On the disconnection of a discrete cylinder by a random walk
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\).
- A lower bound on the disconnection time of a discrete cylinder
- How universal are asymptotics of disconnection times in discrete cylinders?
- Upper bound on the disconnection time of discrete cylinders and random interlacements
- On the disconnection of a discrete cylinder by a biased random walk
- Random walks on discrete cylinders and random interlacements
- Cover times for Brownian motion and random walks in two dimensions
- Enlargement of obstacles for the simple random walk
- scientific article; zbMATH DE number 48363 (Why is no real title available?)
- scientific article; zbMATH DE number 503436 (Why is no real title available?)
- Intersections of random walks.
- Late points for random walks in two dimensions
- On new examples of ballistic random walks in random environment
- On Positive Solutions of the Equation $\mathfrak{A}U + Vu = 0$
- On the time taken by random walks on finite groups to visit every state
- Slowdown and neutral pockets for a random walk in random environment
- Strong invariance for local times
- Surface order large deviations for high-density percolation
- On the uniqueness of the infinite cluster of the vacant set of random interlacements
- Upper bound on the disconnection time of discrete cylinders and random interlacements
- On the domination of a random walk on a discrete cylinder by random interlacements
- On uniform closeness of local times of Markov chains and i.i.d. sequences
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- Painting a graph with competing random walks
- Bernoulli line percolation
- A lower bound for disconnection by simple random walk
- How universal are asymptotics of disconnection times in discrete cylinders?
- A lower bound on the disconnection time of a discrete cylinder
- Percolation for the vacant set of random interlacements
- Decoupling inequalities and interlacement percolation on G Z
- Cover levels and random interlacements
- Disconnection, random walks, and random interlacements
- Finite range interlacements and couplings
- On the size of a finite vacant cluster of random interlacements with small intensity
- Solidification of porous interfaces and disconnection
- Random walks on discrete cylinders and random interlacements
- On the disconnection of a discrete cylinder by a biased random walk
- Vacant set of random interlacements and percolation
This page was built for publication: On the disconnection of a discrete cylinder by a random walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503166)
