arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.02474math.PRcs.DMmath.CO
收藏

完全图上的分散过程

Dispersion on the Complete Graph

Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou

AI总结:

该研究针对完全图上粒子分散过程,分析了临界点附近分散时间的渐近特性,揭示了从对数到指数时间的过渡规律,并给出特定条件下分散时间的阶数及尾部行为界限。

摘要:

我们研究Cooper、McDowell、Radzik、Rivera和Shiraga(2018)提出的粒子在图G顶点上同步移动的过程。初始时,M个粒子被放置在G的一个顶点上。每个时间步开始时,对于每个至少有两个粒子的顶点,这些粒子中的每一个独立随机地移动到均匀随机选择的邻居。当没有顶点被超过一个粒子占据时,过程在第一步结束。Cooper等人证明,当基础图是n个顶点的完全图时,当粒子数M = n/2时会发生相变。他们表明,如果对于某个固定的ε>0,M<(1-ε)n/2,则过程在对数步数内完成,而如果M>(1+ε)n/2,则高概率需要指数步数。在这里,我们提供了临界点附近分散时间的彻底渐近分析,其中ε = o(1),并描述了从对数时间到指数时间的过渡。作为我们结果的一个推论,例如,当|ε| = O(n^{-1/2})时,分散时间在概率和期望上都处于Θ(n^{1/2}),并为其尾部行为提供了定性界限。

英文摘要:

We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. At the beginning of each time step, for every vertex inhabited by at least two particles, each of these particles moves independently to a neighbour chosen uniformly at random. The process ends at the first step when no vertex is inhabited by more than one particle. Cooper et al. showed that when the underlying graph is the complete graph on~$n$ vertices, then there is a phase transition when the number of particles $M = n/2$. They showed that if $M<(1-\varepsilon)n/2$ for some fixed $\varepsilon>0$, then the process finishes in a logarithmic number of steps, while if $M>(1+\varepsilon)n/2$, an exponential number of steps are required with high probability. Here we provide a thorough asymptotic analysis of the dispersion time around criticality, where $\varepsilon = o(1)$, and describe the transition from logarithmic to exponential time. As a consequence of our results we establish, for example, that the dispersion time is in probability and in expectation in $Θ(n^{1/2})$ when $|\varepsilon| = O(n^{-1/2})$, and provide qualitative bounds for its tail behavior.

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

↑