On the disconnection of a discrete cylinder by a random walk (Q2503166): Difference between revisions

From the authors' summary: We investigate the large \(N\) behaviour of the time the simple random walk on the discrete cylinder \((Z/\mathbb{Z})^d\times \mathbb{Z}\) needs to disconnect the discrete cylinder. We show that when \(d\geq 2\), this time is roughly of order \(N^{2d}\) and comparable to the cover time of the slice \((Z/\mathbb{Z})^d\times \{0\}\) but substantially larger than the cover time of the base by the projection of the walk. Further we show that by the time disconnection occurs, a massive ``clogging'' typically takes place in the truncated cylinders of height \(N^{d-\varepsilon}\). These mechanisms are in contrast with what happens when \(d=1\).