A lower bound for disconnection by simple random walk
arXiv:1412.3959 · doi:10.1214/15-AOP1077
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.
arXiv comment39 pages
References in corpus (9)
- Soft local times and decoupling of random interlacements
- Decoupling inequalities and interlacement percolation on G x Z
- On the fragmentation of a torus by random walk
- Giant vacant component left by a random walk in a random d-regular graph
- Disconnection, random walks, and random interlacements
- A lower bound for disconnection by random interlacements
- Connectivity Bounds for the Vacant Set of Random Interlacements
- Large deviations for occupation time profiles of random interlacements
- Disconnection and level-set percolation for the Gaussian free field
Cited by in corpus (6)
- On macroscopic holes in some supercritical strongly dependent percolation models
- On bulk deviations for the local behavior of random interlacements
- Disconnection and entropic repulsion for the harmonic crystal with random conductances
- On the cost of the bubble set for random interlacements
- On the percolative properties of the intersection of two independent interlacements
- Entropic repulsion for the occupation-time field of random interlacements conditioned on disconnection