arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.04351math.PR
收藏

单约束下稠密随机图系综等价的破缺

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

Frank den Hollander, Maarten Markering

摘要:

两个系综经常被用来模拟随机图的约束:微正则系综(=硬约束)和正则系综(=软约束)。当两个系综的特定相对熵不随图的大小趋于无穷大而消失时,称为系综等价性破缺(BEE)。后者意味着,对于图的缩放属性,约束是否满足图的每个单个实现或仅作为整体平均值而存在。在文献中,人们发现,BEE是规则,而不是例外的两类:稀疏随机图时的数量的限制是数量级的顶点和密集的随机图时,有两个或两个以上的限制,受挫。在本文中,我们建立BEE的第三类:稠密随机图与一个单一的约束,即,在一个给定的有限单图的密度。我们发现,BEE只发生在一定范围内的选择的密度和边数的单图,我们称之为BEE阶段。我们发现,在部分的BEE阶段,有一个差距的缩放限制的平均值的最大特征值的邻接矩阵的随机图下的两个合奏,一个属性,被称为频谱签名的BEE。证明基于对Den Hollander等人(2018)推导的限制特定相对熵的图子空间变分公式的分析,结合最小化图子和副本对称参数的识别。我们发现,在副本对称区域的BEE-阶段,随着图的大小趋于无穷大,微正则系综的行为像一个Erdens-Rényi随机图,而正则系综的行为像两个Erdens-Rényi随机图的混合。

英文摘要:

Two ensembles are often 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. The latter means that it matters for the scaling properties of the graph whether the constraint is met for every single realisation of the graph or only holds as an ensemble average. In the literature, it was found that BEE is the rule rather than the exception for two classes: 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. In the present paper we establish BEE for a third class: dense random graphs with a single constraint, namely, on the density of a given finite simple graph. We show that BEE occurs only 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 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 spectral signature of BEE. Proofs are based on an analysis of the variational formula on the space of graphons for the limiting specific relative entropy derived by Den Hollander et al. (2018), in combination with an identification of the minimising graphons and replica symmetry arguments. We show that in the replica symmetric region of the BEE-phase, as the size of the graph tends to infinity, the microcanonical ensemble behaves like an Erdős-Rényi random graph, while the canonical ensemble behaves like a mixture of two Erdős-Rényi random graphs.

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

↑