Giant Component and Vacant Set for Random Walk on a Discrete Torus
Abstract
We consider random walk on a discrete torus E of side-length N, in sufficiently high dimension d. We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk up to time uNd. We show that when u is chosen small, as N tends to infinity, there is with overwhelming probability a unique connected component in the vacant set which contains segments of length const log N. Moreover, this connected component occupies a non-degenerate fraction of the total number of sites Nd of E, and any point of E lies within distance an arbitrary fractional power of N from this component.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.