Breaking of ensemble equivalence for dense random graphs under a single constraint

arXiv (Cornell University)(2023)

引用 0|浏览3
暂无评分
摘要
Two ensembles are frequently used to model random graphs subject to constraints: the microcanonical ensemble (= hard constraint) and the canonical ensemble (= soft constraint). It is said that breaking of ensemble equivalence (BEE) occurs when the specific relative entropy of the two ensembles does not vanish as the size of the graph tends to infinity. Various examples have been analysed in the literature. It was found that BEE is the rule rather than the exception for two classes of constraints: sparse random graphs when the number of constraints is of the order of the number of vertices, and dense random graphs when there are two or more constraints that are frustrated. We establish BEE for a third class: dense random graphs with a single constraint on the density of a given simple graph. We show that BEE occurs in a certain range of choices for the density and the number of edges of the simple graph, which we refer to as the BEE-phase. We also show that, in part of the BEE-phase, there is a gap between the scaling limits of the averages of the maximal eigenvalue of the adjacency matrix of the random graph under the two ensembles, a property that is referred to as the spectral signature of BEE. We further show that in the replica symmetric region of the BEE-phase, BEE is due to the coexistence of two densities in the canonical ensemble.
更多
查看译文
关键词
Constrained random graph,Gibbs ensemble,relative entropy,breaking of ensemble equivalence,graphon,variational representation,maximal eigenvalues,replica symmetry
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要