On the fragmentation of a torus by random walk

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.

37 pages, 3 figures

References in corpus (3)

• On the uniqueness of the infinite cluster of the vacant set of random interlacements
• Giant vacant component left by a random walk in a random d-regular graph
• Connectivity Bounds for the Vacant Set of Random Interlacements

Cited by in corpus (28)

• Soft local times and decoupling of random interlacements
• Decoupling inequalities and interlacement percolation on G x Z
• On chemical distances and shape theorems in percolation models with long-range correlations
• Equality of critical parameters for percolation of Gaussian free field level-sets
• On the internal distance in the interlacement set
• Giant vacant component left by a random walk in a random d-regular graph
• On scaling limits and Brownian interlacements
• Random interlacements and the Gaussian free field
• The effect of small quenched noise on connectivity properties of random interlacements
• Two-dimensional random interlacements and late points for random walks
• A lower bound for disconnection by random interlacements
• Geometry of Gaussian free field sign clusters and random interlacements
• Cover levels and random interlacements
• Random interlacements and amenability
• Local picture and level-set percolation of the Gaussian free field on a large discrete torus
• A lower bound for disconnection by simple random walk
• Large deviations for occupation time profiles of random interlacements
• Quenched large deviations for simple random walks on percolation models including long-range correlations
• Cover times in the discrete cylinder
• On (non-)monotonicity and phase diagram of finitary random interlacement
• Universality of trap models in the ergodic time scale
• Percolative properties of Brownian interlacements and its vacant set
• Branching interlacements and tree-indexed random walks in tori
• First passage percolation, local uniqueness for interlacements and capacity of random walk
• On pinned fields, interlacements, and random walk on $(\mathbb{Z}/N\mathbb{Z}{)}^2$
• Fluctuation results for size of the vacant set for random walks on discrete torus
• One-dimensional random interlacements
• Entropic repulsion for the occupation-time field of random interlacements conditioned on disconnection