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

随机图的标度极限

Scaling limits of random graphs

Louigi Addario-Berry, Christina Goldschmidt

AI总结:

本文综述了随机图的标度极限理论,探讨当尺寸趋于无穷大且距离适当缩放时随机图的大尺度几何结构,涵盖从随机树到临界 Erdős--Rényi 随机图的实例。

摘要:

本文将作为名为《Topics in Probabilistic Graph Theory》的即将出版著作的一章。近年来,随机图的标度极限理论已被发展。该理论使人们能够在随机对象尺寸趋于无穷大且距离被适当重新标度的情况下,获得其大尺度几何结构。我们从随机树的最简单设定开始,随后转向各种随机图的例子,包括临界 Erdős--Rényi 随机图。

英文摘要:

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric structure of these random objects in the limit as their size goes to infinity, with distances appropriately rescaled. We start with the simplest setting of random trees, before turning to various examples of random graphs, including the critical Erdős--Rényi random graph.

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

↑