On the fragmentation of a torus by random walk
From MaRDI portal
Publication:3100889
Abstract: We consider a simple random walk on a discrete torus (Z/NZ)^d with dimension d at least 3 and large side length N. For a fixed constant u > 0, we study the percolative properties of the vacant set, consisting of the set of vertices not visited by the random walk in its first [uN^d] steps. We prove the existence of two distinct phases of the vacant set in the following sense: if u > 0 is chosen large enough, all components of the vacant set contain no more than a power of log(N) vertices with high probability as N tends to infinity. On the other hand, for small u > 0, there exists a macroscopic component of the vacant set occupying a non degenerate fraction of the total volume N^d. In dimensions d at least 5, we additionally prove that this macroscopic component is unique, by showing that all other components have volumes of order at most a power of log(N). Our results thus solve open problems posed by Benjamini and Sznitman in arXiv:math/0610802, who studied the small u regime in high dimension. The proofs are based on a coupling of the random walk with random interlacements on Z^d. Among other techniques, the construction of this coupling employs a refined use of discrete potential theory. By itself, this coupling strengthens a result in arXiv:0802.3654.
Recommendations
- Giant component and vacant set for random walk on a discrete torus
- Random walks on torus and random interlacements: macroscopic coupling and phase transition
- Logarithmic components of the vacant set for random walk on a discrete torus
- Vacant set of random interlacements and percolation
- Transience of the vacant set for near-critical random interlacements in high dimensions
Cites work
- scientific article; zbMATH DE number 5819433 (Why is no real title available?)
- scientific article; zbMATH DE number 3759223 (Why is no real title available?)
- Component structure of the vacant set induced by a random walk on a random graph
- Connectivity bounds for the vacant set of random interlacements
- Giant component and vacant set for random walk on a discrete torus
- Inequalities for rare events in time-reversible Markov chains. I.
- Interlacing eigenvalues and graphs
- Intersections of random walks.
- Kac's moment formula and the Feynman-Kac formula for additive functionals of a Markov process
- Markov chain models - rarity and exponentiality
- On Positive Solutions of the Equation $\mathfrak{A}U + Vu = 0$
- On the domination of a random walk on a discrete cylinder by random interlacements
- On the size of a finite vacant cluster of random interlacements with small intensity
- On the uniqueness of the infinite cluster of the vacant set of random interlacements
- Percolation for the vacant set of random interlacements
- Random walk on a discrete torus and random interlacements
- Upper bound on the disconnection time of discrete cylinders and random interlacements
- Vacant set of random interlacements and percolation
Cited in
(30)- Logarithmic components of the vacant set for random walk on a discrete torus
- Percolative properties of Brownian interlacements and its vacant set
- Two-dimensional random interlacements and late points for random walks
- Phase transition for the vacant set left by random walk on the giant component of a random graph
- Local percolative properties of the vacant set of random interlacements with small intensity
- Random interlacements and amenability
- On scaling limits and Brownian interlacements
- Equality of critical parameters for percolation of Gaussian free field level sets
- Giant component and vacant set for random walk on a discrete torus
- Random interlacements and the Gaussian free field
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- A characterization of strong percolation via disconnection
- Entropic repulsion for the occupation-time field of random interlacements conditioned on disconnection
- Transience of the vacant set for near-critical random interlacements in high dimensions
- Linear random walks on the torus
- Soft local times and decoupling of random interlacements
- Cover-time Gumbel fluctuations in finite-range, symmetric, irreducible random walks on torus
- On the range of a random walk in a torus and random interlacements
- A one-dimensional version of the random interlacements
- Extremal geometry of a Brownian porous medium
- On chemical distances and shape theorems in percolation models with long-range correlations
- Local picture and level-set percolation of the Gaussian free field on a large discrete torus
- Random walks on torus and random interlacements: macroscopic coupling and phase transition
- First passage percolation, local uniqueness for interlacements and capacity of random walk
- Critical window for the vacant set left by random walk on random regular graphs
- On pinned fields, interlacements, and random walk on \(({\mathbb {Z}}/N {\mathbb {Z}})^2\)
- Gumbel fluctuations for cover times in the discrete torus
- Large deviations for occupation time profiles of random interlacements
- Quenched large deviations for simple random walks on percolation clusters including long-range correlations
- Decoupling inequalities and interlacement percolation on \(G\times \mathbb Z\)
This page was built for publication: On the fragmentation of a torus by random walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100889)
