arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1712.03389cs.DMmath.CO
收藏

分散法

Dispersion processes

Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga

摘要:

我们研究了一个同步扩散过程,其中$M$粒子最初被放置在一个杰出的原始顶点的图$G$。在每个时间步,在该步开始时由多个粒子占据的每个顶点$v$处,这些粒子中的每一个移动到独立且均匀随机选择的$v$的邻居。一旦粒子全部停止移动,即在每个顶点被最多一个粒子占据的第一步,分散过程结束。对于完全图$K_n$和星形图$S_n$,我们表明,对于任何恒定的$δ>1$,具有高概率,如果$M \le n/2(1-δ)$,那么该过程在$O(\log n)$步骤中完成,而如果$M \ge n/2(1+δ)$,那么该过程需要$e^{Ω(n)}$步骤来完成(如果有的话)。我们还表明,一个类似的懒惰的过程中表现出相同的行为,但更高的阈值,允许更快的分散更多的粒子。对于路径,树,网格,超立方体和凯莱图的足够大的大小(在$M$方面),我们给出的边界上的时间完成和从原点的最大距离作为粒子数$M$的函数。

英文摘要:

We study a synchronous dispersion process in which $M$ particles are initially placed at a distinguished origin vertex of a graph $G$. At each time step, at each vertex $v$ occupied by more than one particle at the beginning of this step, each of these particles moves to a neighbour of $v$ chosen independently and uniformly at random. The dispersion process ends once the particles have all stopped moving, i.e. at the first step at which each vertex is occupied by at most one particle. For the complete graph $K_n$ and star graph $S_n$, we show that for any constant $δ>1$, with high probability, if $M \le n/2(1-δ)$, then the process finishes in $O(\log n)$ steps, whereas if $M \ge n/2(1+δ)$, then the process needs $e^{Ω(n)}$ steps to complete (if ever). We also show that an analogous lazy variant of the process exhibits the same behaviour but for higher thresholds, allowing faster dispersion of more particles. For paths, trees, grids, hypercubes and Cayley graphs of large enough sizes (in terms of $M$) we give bounds on the time to finish and the maximum distance traveled from the origin as a function of the number of particles $M$.

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

↑