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

随机图中领导问题的一种概率方法

A probabilistic approach to the leader problem in random graphs

Louigi Addario-Berry, Shankar Bhamidi, Sanchayan Sen

摘要:

我们研究了领导者身份的固定时间,即,在Aldous的乘法聚结[4,5]的一般设置中,最大质量的组分,在渐近意义上描述了广泛的近临界聚结过程(包括经典的Erdens-Rényi过程)的组分尺寸的演变。我们在“布朗”制度的固定时间的紧密性,明确确定固定时间的中值内的最佳$O(1)$窗口。这推广了Erdens-Rényi随机图的Jumuczak [31]的结果,使用完全不同的技术。在重尾的情况下,其中的组件大小的限制可以使用一个稀疏的纯跳Lévy过程编码,我们证明,只有单侧紧举行。这显示了两种机制中可能的行为的真正差异。Erdens-Rényi随机图中领导者问题的求解在完全图上最小生成树的标度极限的研究中起了重要作用[2]。我们相信,类似的结果,如本文所证明的,将是有用的,在建立一个大类的模型的最小生成树的内在几何的普遍性。

英文摘要:

We study the fixation time of the identity of the leader, i.e., the most massive component, in the general setting of Aldous's multiplicative coalescent [4, 5], which in an asymptotic sense describes the evolution of the component sizes of a wide array of near-critical coalescent processes, including the classical Erdős-Rényi process. We show tightness of the fixation time in the "Brownian" regime, explicitly determining the median value of the fixation time to within an optimal $O(1)$ window. This generalizes Łuczak's result [31] for the Erdős-Rényi random graph using completely different techniques. In the heavy-tailed case, in which the limit of the component sizes can be encoded using a thinned pure-jump Lévy process, we prove that only one-sided tightness holds. This shows a genuine difference in the possible behavior in the two regimes. The solution to the leader problem in the setting of the Erdős-Rényi random graph played an important role in the study of the scaling limit of the minimal spanning tree on the complete graph [2]. We believe that analogous results, such as those proved herein, will be useful in establishing universality of the intrinsic geometry of the minimal spanning tree across a large class of models.

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

↑