Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 69 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 37 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 119 tok/s Pro
Kimi K2 218 tok/s Pro
GPT OSS 120B 456 tok/s Pro
Claude Sonnet 4.5 33 tok/s Pro
2000 character limit reached

On the fragmentation of a torus by random walk (1007.0902v1)

Published 6 Jul 2010 in math.PR

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 [uNd] 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 Nd. 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 Zd. 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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.