Vacant set of random interlacements and percolation

158Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Zd, d ≥ 3. A nonnegative parameter u measures how many trajectories enter the picture. This model describes in the large N limit the microscopic structure in the bulk, which arises when considering the disconnection time of a discrete cylinder .(Z=NZ)d-1 × Z by simple random walk, or the set of points visited by simple random walk on the discrete torus .(Z=NZ)d at times of order uNd. In particular we study the percolative properties of the vacant set left by the interlacement at level u, which is an infinite connected translation invariant random subset of Zd. We introduce a critical value u* such that the vacant set percolates for u < u* and does not percolate for u > u*. Our main results show that u* is finite when d ≥ 3 and strictly positive when d ≥ 7. © 2010 Annals of Mathematics.

Cite

CITATION STYLE

APA

Sznitman, A. S. (2010). Vacant set of random interlacements and percolation. Annals of Mathematics, 171(3), 2039–2087. https://doi.org/10.4007/annals.2010.171.2039

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free