arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.08411math.PRquant-ph
收藏

Asymptotic entropy of the Gibbs state of complex networks

Adam Glos, Aleksandra Krawiec, Łukasz Pawela

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑