On the transience of random interlacements

Balazs Rath (ETH, Zurich)
Artem Sapozhnikov (ETH, Zurich)

Abstract


We consider the interlacement Poisson point process on the space of doubly-infinite $\mathbb{Z}^d$-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least one of these trajectories is the graph induced by the random interlacements at level $u$ of Sznitman(2010). We prove that for any $u > 0$, almost surely, the random interlacement graph is transient.

Full Text: Download PDF | View PDF online (requires PDF plugin)

Pages: 379-391

Publication Date: July 7, 2011

DOI: 10.1214/ECP.v16-1637

References

  1. N. C. Jain and S. Orey. Some properties of random walk paths. J. Math. Anal. Appl. 43 (1973), 795-815. Math. Review 50 #11460
  2. G. Lawler. Intersections of random walks. Birkhauser, Basel (1991). Math. Review 92f:60122
  3. T. Lyons. A Simple Criterion for Transience of a Reversible Markov Chain. Ann. Probab. 11 (1983), 393-402. Math. Review 84e:60102
  4. R. Lyons and Y. Peres. Probability on Trees and Networks. Cambridge University Press (2011). In preparation. Current version.
  5. R. E. A. C. Paley and A. Zygmund. A note on analytic functions in the unit circle. Proc. Camb. Phil. Soc. 28 (1932), 266-272.
  6. E. B. Procaccia and J. Tykesson. Geometry of the random interlacement. Preprint (2011). arXiv:1101.1527.
  7. B. Rath and A. Sapozhnikov. Connectivity properties of random interlacement and intersection of random walks. Preprint (2010). arXiv:1012.4711.
  8. F. Spitzer. Principles of random walks. Springer-Verlag (2001), Second edition.
  9. A.-S. Sznitman. Vacant set of random interlacements and percolation. Ann. Math. 171 (2010), 2039-2087. Math. Review 2011g:60185
  10. A. Teixeira. Interlacement percolation on transient weighted graphs. Electron. J. Probab. 14 (2009), 1604-1628. Math. Review 2011b:60393
  11. A. Teixeira and J. Tykesson. Random interlacements and amenability. Preprint (2011). arXiv:1103.2109.
Bookmark and Share


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.