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

空集和空网:由随机游动诱导的成分结构

Vacant sets and vacant nets: Component structures induced by a random walk

Colin Cooper, Alan Frieze

摘要:

给定有限图$G$上的离散随机游动,空集和空网分别是在给定步$G$上游动未访问的顶点和边的集合.这些集合导出了底层图的子图。设$Γ(t)$是$G$的子图,由在步骤$t$处的行走的空集诱导。类似地,设$\widehat Γ(t)$是由空网的边导出的$G$的子图。对于随机$r$ -正则图$G_r$,先前已经建立了对于简单的随机游动,空集的图$Γ(t)$经历了Erd \H{os} -Renyi图$G_{n,p}$上相变意义上的相变.因此,对于$r \ge 3$,存在行走的显式值$t^*=t^*(r)$,使得对于$t\leq (1-ε)t^*$,$Γ(t)$具有唯一的巨型分量,加上大小为$O(\log n)$的分量,而对于$t\geq (1+ε)t^*$,$Γ(t)$的所有分量的大小都为$O(\log n)$。我们建立了随机$r$ -正则图上简单随机游动空网的图$\widehat Γ(t)$中相变的阈值$\widehat t$。得到了两种修正随机游动的空集和空网的相应阈值结果。这是一个非回溯的随机游动,甚至对于$r$来说,也是一个随机游动,它在可用的时候选择未访问的边。这允许直接比较随机$r$ -正则图上简单和修改的行走之间的阈值。主要研究结果如下:随着$r$的增加,空集的阈值在所有三次行走中都收敛到$n \log r$。对于空网,简单随机游动和非回溯随机游动的阈值都收敛于$rn/2 \; \log n$。当$r\ge 4$为偶数时,未访问边过程的空网阈值收敛于$rn/2$,这也是该过程的顶点覆盖时间。

英文摘要:

Given a discrete random walk on a finite graph $G$, the vacant set and vacant net are, respectively, the sets of vertices and edges which remain unvisited by the walk at a given step $t$.%These sets induce subgraphs of the underlying graph. Let $Γ(t)$ be the subgraph of $G$ induced by the vacant set of the walk at step $t$. Similarly, let $\widehat Γ(t)$ be the subgraph of $G$ induced by the edges of the vacant net. For random $r$-regular graphs $G_r$, it was previously established that for a simple random walk, the graph $Γ(t)$ of the vacant set undergoes a phase transition in the sense of the phase transition on Erd\H{os}-Renyi graphs $G_{n,p}$. Thus, for $r \ge 3$ there is an explicit value $t^*=t^*(r)$ of the walk, such that for $t\leq (1-ε)t^*$, $Γ(t)$ has a unique giant component, plus components of size $O(\log n)$, whereas for $t\geq (1+ε)t^*$ all the components of $Γ(t)$ are of size $O(\log n)$. We establish the threshold value $\widehat t$ for a phase transition in the graph $\widehat Γ(t)$ of the vacant net of a simple random walk on a random $r$-regular graph. We obtain the corresponding threshold results for the vacant set and vacant net of two modified random walks. These are a non-backtracking random walk, and, for $r$ even, a random walk which chooses unvisited edges whenever available. This allows a direct comparison of thresholds between simple and modified walks on random $r$-regular graphs. The main findings are the following: As $r$ increases the threshold for the vacant set converges to $n \log r$ in all three walks. For the vacant net, the threshold converges to $rn/2 \; \log n$ for both the simple random walk and non-backtracking random walk. When $r\ge 4$ is even, the threshold for the vacant net of the unvisited edge process converges to $rn/2$, which is also the vertex cover time of the process.

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

↑