Approximations for the von Neumann and Rényi entropies of graphs with circulant type Laplacians

Abstract

In this note, we approximate the von Neumann and Rényi entropies of high-dimensional graphs using the Euler-Maclaurin summation formula. The obtained estimations have a considerable degree of accuracy. The performed experiments suggest some entropy problems concerning graphs whose Laplacians are g-circulant matrices, i.e., circulant matrices with g-periodic diagonals, or quasi-Toeplitz matrices. Quasi means that in a Toeplitz matrix the first two elements in the main diagonal, and the last two, differ from the remaining diagonal entries by a perturbation.

Keywords

• entropy
• graphs
• laplacian matrix
• euler-maclaurin summation formula