The Annals of Probability

On the critical parameter of interlacement percolation in high dimension

Alain-Sol Sznitman

Full-text: Open access


The vacant set of random interlacements on ℤd, d≥3, has nontrivial percolative properties. It is known from Sznitman [Ann. Math. 171 (2010) 2039–2087], Sidoravicius and Sznitman [Comm. Pure Appl. Math. 62 (2009) 831–858] that there is a nondegenerate critical value u such that the vacant set at level u percolates when u<u and does not percolate when u>u. We derive here an asymptotic upper bound on u, as d goes to infinity, which complements the lower bound from Sznitman [Probab. Theory Related Fields, to appear]. Our main result shows that u is equivalent to log d for large d and thus has the same principal asymptotic behavior as the critical parameter attached to random interlacements on 2d-regular trees, which has been explicitly computed in Teixeira [Electron. J. Probab. 14 (2009) 1604–1627].

Article information

Ann. Probab., Volume 39, Number 1 (2011), 70-103.

First available in Project Euclid: 3 December 2010

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60G50: Sums of independent random variables; random walks 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43] 82C41: Dynamics of random walks, random surfaces, lattice animals, etc. [See also 60G50]

Percolation random interlacements renormalization scheme high dimension


Sznitman, Alain-Sol. On the critical parameter of interlacement percolation in high dimension. Ann. Probab. 39 (2011), no. 1, 70--103. doi:10.1214/10-AOP545.

Export citation


  • [1] Alon, N., Benjamini, I. and Stacey, A. (2004). Percolation on finite graphs and isoperimetric inequalities. Ann. Probab. 32 1727–1745.
  • [2] Bollobás, B. and Kohayakawa, Y. (1994). Percolation in high dimensions. European J. Combin. 15 113–125.
  • [3] Broadbent, S. R. and Hammersley, J. M. (1957). Percolation processes. I. Crystals and mazes. Proc. Cambridge Philos. Soc. 53 629–641.
  • [4] Černý, J., Teixeira, A. and Windisch, D. (2009). Giant vacant component left by a random walk in a random d-regular graph. Preprint. Available at
  • [5] Chung, K. L. (1960). Markov Chains with Stationary Transition Probabilities. Springer, Berlin.
  • [6] Gordon, D. M. (1991). Percolation in high dimensions. J. London Math. Soc. (2) 44 373–384.
  • [7] Grigor’yan, A. and Telcs, A. (2001). Sub-Gaussian estimates of heat kernels on infinite graphs. Duke Math. J. 109 451–510.
  • [8] Grimmett, G. (1999). Percolation, 2nd ed. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 321. Springer, Berlin.
  • [9] Hara, T. and Slade, G. (1990). Mean-field critical behaviour for percolation in high dimensions. Comm. Math. Phys. 128 333–391.
  • [10] Hara, T. and Slade, G. (1992). The lace expansion for self-avoiding walk in five or more dimensions. Rev. Math. Phys. 4 235–327.
  • [11] Kesten, H. (1990). Asymptotics in high dimensions for percolation. In Disorder in Physical Systems 219–240. Oxford Univ. Press, New York.
  • [12] Lawler, G. F. (1991). Intersections of Random Walks. Birkhäuser, Boston, MA.
  • [13] Montroll, E. W. (1956). Random walks in multidimensional spaces, especially on periodic lattices. J. Soc. Indust. Appl. Math. 4 241–260.
  • [14] Olver, F. W. J. (1974). Asymptotics and Special Functions. Academic Press, New York.
  • [15] Pang, M. M. H. (1993). Heat kernels of graphs. J. London Math. Soc. (2) 47 50–64.
  • [16] Sidoravicius, V. and Sznitman, A.-S. (2009). Percolation for the vacant set of random interlacements. Comm. Pure Appl. Math. 62 831–858.
  • [17] Sidoravicius, V. and Sznitman, A. S. (2010). Connectivity bounds for the vacant set of random interlacements. Ann. Inst. H. Poincaré Probab. Statist. 46 976–990.
  • [18] Sznitman, A. S. (2010). Vacant set of random interlacements and percolation. Ann. Math. 171 2039–2087.
  • [19] Sznitman, A.-S. (2009). Upper bound on the disconnection time of discrete cylinders and random interlacements. Ann. Probab. 37 1715–1746.
  • [20] Sznitman, A.-S. (2009). On the domination of random walk on a discrete cylinder by random interlacements. Electron. J. Probab. 14 1670–1704.
  • [21] Sznitman, A. S. (2010). A lower bound on the critical parameter of interlacement percolation in high dimension. Probab. Theory Related Fields. To appear. Available at arXiv:1003.0334.
  • [22] Teixeira, A. (2009). On the uniqueness of the infinite cluster of the vacant set of random interlacements. Ann. Appl. Probab. 19 454–466.
  • [23] Teixeira, A. (2009). Interlacement percolation on transient weighted graphs. Electron. J. Probab. 14 1604–1628.