arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.09219cs.DMmath.COmath.PR
收藏

有限图上随机游动的分散时间

The dispersion time of random walks on finite graphs

Nicolas Rivera, Alexandre Stauffer, Thomas Sauerwald, John Sylvester

摘要:

我们研究了$n$ -顶点图上的两个随机过程,它们受内扩散限制聚集(IDLA)模型的启发。在这两个过程中,$n$粒子从任意但固定的原点开始。每个粒子执行一个简单的随机游走,直到第一次遇到一个未被占用的顶点,并在该点的顶点被占用和随机游走终止。在其中一个称为\textit{Sequential-IDLA}的过程中,只有一个颗粒移动直到沉降,然后才开始下一个颗粒,而在第二个称为\textit{Parallel-IDLA}的过程中,所有未沉降的颗粒同时移动。我们的主要目标是分析这些过程的所谓分散时间,这是任何$n$粒子执行的最大步骤数。为了比较这两个过程中,我们开发了一个耦合,这表明分散时间的顺序IDLA的顺序IDLA的随机占主导地位,但是,所有粒子进行的步骤的总数在两个过程中具有相同的分布。这种耦合还使我们知道,序列IDLA的色散时间在预期中受序列IDLA的色散时间的限制,直到乘法$\log n$因子。此外,我们得到了几个图类,如团,圈,二叉树,$d$维网格,超立方体和扩张的色散时间的渐近上界和下界。我们的大多数边界都紧到一个乘法常数。

英文摘要:

We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk until first encountering an unoccupied vertex, and at which point the vertex becomes occupied and the random walk terminates. In one of the processes, called \textit{Sequential-IDLA}, only one particle moves until settling and only then does the next particle start whereas in the second process, called \textit{Parallel-IDLA}, all unsettled particles move simultaneously. Our main goal is to analyze the so-called dispersion time of these processes, which is the maximum number of steps performed by any of the $n$ particles. In order to compare the two processes, we develop a coupling which shows the dispersion time of the Parallel-IDLA stochastically dominates that of the Sequential-IDLA; however, the total number of steps performed by all particles has the same distribution in both processes. This coupling also gives us that dispersion time of Parallel-IDLA is bounded in expectation by dispersion time of the Sequential-IDLA up to a multiplicative $\log n$ factor. Moreover, we derive asymptotic upper and lower bound on the dispersion time for several graph classes, such as cliques, cycles, binary trees, $d$-dimensional grids, hypercubes and expanders. Most of our bounds are tight up to a multiplicative constant.

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

↑