Asymptotic entropy of the Gibbs state of complex networks
arXiv:2003.08411 · doi:10.1038/s41598-020-78626-2
Abstract
In this work we study the entropy of the Gibbs state corresponding to a graph. The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature. We illustrate our analytical results with numerical simulations for Erdős-Rényi, Watts-Strogatz, Barabási-Albert and Chung-Lu graph models and a few real-world graphs. Our results show that the behavior of Gibbs entropy as a function of the temperature differs for a choice of real networks when compared to the random Erdős-Rényi graphs.
References in corpus (10)
- Statistical mechanics of complex networks
- Spatial search by quantum walk
- Spectral entropies as information-theoretic tools for complex network comparison
- The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Laplacian versus Adjacency Matrix in Quantum Walk Search
- Enhancing transport properties in interconnected systems without altering their structure
- Vertices cannot be hidden from quantum spatial search for almost all random graphs
- Thermodynamics of network model fitting with spectral entropies
- Thermal state entanglement entropy on a quantum graph