Author:
Glos Adam,Krawiec Aleksandra,Pawela Łukasz
Abstract
AbstractIn 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.
Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. Erdős, P. & Rényi, A. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5(1), 17–60 (1960).
2. Albert, R. & Barabási, A.-L. Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002).
3. Watts, D. J. & Strogatz, S. H. Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440 (1998).
4. De Domenico, M. & Biamonte, J. Spectral entropies as information-theoretic tools for complex network comparison. Phys. Rev. X 6(4), 041062 (2016).
5. Kenkre, V., Montroll, E. & Shlesinger, M. Generalized master equations for continuous-time random walks. J. Stat. Phys. 9(1), 45–50 (1973).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献