arXiv Analytics

Sign in

arXiv:1003.0334 [math.PR]AbstractReferencesReviewsResources

A lower bound on the critical parameter of interlacement percolation in high dimension

Alain-Sol Sznitman

Published 2010-03-01Version 1

We investigate the percolative properties of the vacant set left by random interlacements on Z^d, when d is large. A non-negative parameter u controls the density of random interlacements on Z^d. It is known from arXiv:0704.2560, and arXiv:0808.3344, that there is a non-degenerate critical value u_*, such that the vacant set at level u percolates when u < u_*, and does not percolate when u > u_*. Little is known about u_*, however for large d, random interlacements on Z^d, ought to exhibit similarities to random interlacements on a (2d)-regular tree, for which the corresponding critical parameter can be explicitly computed, see arXiv:0907.0316. We prove in this article a lower bound on u_*, which is equivalent to log(d) as d goes to infinity. This lower bound is in agreement with the above mentioned heuristics.

Comments: 31 pages, 1 figure, accepted for publication in Probability Theory and Related Fields
Journal: Probab. Theory Relat. Fields, 2011, Vol. 150, 575-611
Categories: math.PR, math-ph, math.MP
Subjects: 60K35, 60G50, 82C41
Related articles: Most relevant | Search more
arXiv:1003.1289 [math.PR] (Published 2010-03-05, updated 2010-12-07)
On the critical parameter of interlacement percolation in high dimension
arXiv:1010.1490 [math.PR] (Published 2010-10-07, updated 2011-06-30)
Decoupling inequalities and interlacement percolation on G x Z
arXiv:1908.10213 [math.PR] (Published 2019-08-27)
Critical Parameters for Loop and Bernoulli Percolation