A lower bound for disconnection by simple random walk
Xinyi Li

TL;DR
This paper establishes asymptotic lower bounds for the probability that a large body becomes disconnected from infinity by a simple random walk in high dimensions, linking to random interlacements and previous upper bounds.
Contribution
It introduces new lower bounds for disconnection probabilities using tilted walks and connects these bounds to the theory of random interlacements, advancing understanding of disconnection phenomena.
Findings
Derived asymptotic lower bounds for disconnection probability
Linked lower bounds to random interlacements theory
Potentially matched with existing upper bounds
Abstract
We consider simple random walk on Z^d, d bigger or equal to 3. Motivated by the work of A.-S. Sznitman and the author in arXiv:1304.7477 and arXiv:1310.2177, we investigate the asymptotic behaviour of the probability that a large body gets disconnected from infinity by the set of points visited by a simple random walk. We derive asymptotic lower bounds that bring into play random interlacements. Although open at the moment, some of the lower bounds that we obtain possibly match the asymptotic upper bounds obtained in a recent article of A.-S. Sznitman. This potentially yields special significance to the tilted walks that we use in this work, and to the strategy that we employ to implement disconnection.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Quasicrystal Structures and Properties · Stochastic processes and statistical mechanics
