arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1703.08058math.PR
收藏

稠密图的包围等价

Ensemble equivalence for dense graphs

F. den Hollander, M. Mandjes, A. Roccaverde, N. J. Starreveld

摘要:

在本文中,我们考虑一个随机图的拓扑限制,如限制的总数量的边缘,楔,三角形。我们在稠密区域工作,其中每个顶点的边数与顶点数成比例地缩放$n$。我们的目标是比较微正则系综(其中的约束满足每个实现的图形)与正则系综(其中的约束满足平均),都受到最大熵。当$n$变大时,我们计算极限中两个系综的相对熵,其中如果相对熵除以$n^2$趋于零,则称两个系综在稠密区域中为\emph{equivalent}。我们的主要结果,其证明依赖于大偏差理论的graphons,是破坏的系综等价时发生的约束是\emph{frustrated}。提供了三种不同的约束选择的例子。

英文摘要:

In this paper we consider a random graph on which topological restrictions are imposed, such as constraints on the total number of edges, wedges, and triangles. We work in the dense regime, in which the number of edges per vertex scales proportionally to the number of vertices $n$. Our goal is to compare the micro-canonical ensemble (in which the constraints are satisfied for every realisation of the graph) with the canonical ensemble (in which the constraints are satisfied on average), both subject to maximal entropy. We compute the relative entropy of the two ensembles in the limit as $n$ grows large, where two ensembles are said to be \emph{equivalent} in the dense regime if this relative entropy divided by $n^2$ tends to zero. Our main result, whose proof relies on large deviation theory for graphons, is that breaking of ensemble equivalence occurs when the constraints are \emph{frustrated}. Examples are provided for three different choices of constraints.

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

↑