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

几乎2-正则随机度约束过程的临界时间

Critical time of the almost 2-regular random degree constrained process

Department of Stochastics, Institute of Mathematics, Budapest University of Technology and Economics(布达佩斯技术与经济大学数学研究所随机论系);HUN-REN–BME Stochastics Research Group, Budapest University of Technology and Economics(匈牙利研究与创新网络-布达佩斯技术与经济大学随机论研究组);HUN-REN Alfréd Rényi Institute of Mathematics(匈牙利研究与创新网络阿尔弗雷德·雷尼数学研究所)

Balázs Ráth, Márton Szőke

AI总结:

本文研究了几乎2-正则随机度约束过程的临界时间,通过谱分析方法揭示了其渐进行为,与Molloy-Reed公式相匹配。

摘要:

我们研究了随机度约束过程(RDCP)的相变现象,这是一种时间演化随机图模型,由Ruciński和Wormald引入,扩展了随机d过程到非正则情形:完全图K_n的每个顶点都有预设的度约束(即从集合{2,…,Δ}中选取的数),我们尝试以均匀随机顺序逐条添加边,但只有当新边不违反其端点顶点的度约束时才添加。Warnke和Wormald确定了当n趋于无穷大时,巨连通分量出现的临界时间。Ráth、Szőke和Warnke确定了RDCP的局部弱极限,并给出了临界时间的另一种刻画方式,即通过多类型分支过程的主特征值来描述。在本文中,我们利用这种谱刻画方法,研究了几乎2-正则情形下的RDCP临界时间,即当大多数顶点的度约束为2时。在这种情况下,巨连通分量出现得相当晚,我们的主要结果给出了模型接近2-正则时临界时间的精确渐进行为。有趣的是,我们的公式在渐进行为上与著名的Molloy-Reed公式相匹配,尽管Molloy、Surya和Warnke证明了RDCP的最终图不连续于具有相同度序列的配置模型。

英文摘要:

We study the phase transition of the random degree constrained process (RDCP), a time-evolving random graph model introduced by Ruciński and Wormald that generalizes the random $d$-process to the non-regular setting: each vertex of the complete graph $K_n$ has its pre-assigned degree constraint (i.e., a number from the set $\{2,\dots,Δ\}$), we attempt to add the edges one-by-one in a uniform random order, but a new edge is added only if it does not violate the degree constraints at its end-vertices. Warnke and Wormald identified the critical time of the RDCP when the giant component emerges as $n \to \infty$. Ráth, Szőke and Warnke identified the local weak limit of the RDCP and gave an alternative characterization of the critical time in terms of the principal eigenvalue of the branching operator of the multi-type branching process that arises as the local limit object. In the current paper we use this spectral characterization to study the critical time of the RDCP in the almost 2-regular case, i.e., when the degree constraint of most of the vertices is equal to 2. In this case the giant component emerges quite late, and our main result provides the precise asymptotics of the critical time as the model approaches 2-regularity. Interestingly, our formula asymptotically matches the well-known Molloy-Reed formula, despite the fact that Molloy, Surya and Warnke proved that the final graph of the RDCP is not contiguous to the configuration model with the same degree sequence.

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

↑