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

DOI10.1007/S00440-010-0284-9zbMATH Open1230.60103arXiv1003.0334OpenAlexW2964002178MaRDI QIDQ718896FDOQ718896

Alain-Sol Sznitman

Publication date: 27 September 2011

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1003.0334

zbMATH Keywords

random walkspercolationrandom interlacementsweighted graphsvacant setsgrowing treessprinkling

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Sums of independent random variables; random walks (60G50) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vacant set of random interlacements and percolation
• Random walk on a discrete torus and random interlacements
• Interlacement percolation on transient weighted graphs
• On the domination of a random walk on a discrete cylinder by random interlacements
• Domination by product measures
• Random walks on discrete cylinders and random interlacements
• Edge-isoperimetric inequalities in the grid
• Percolation for the vacant set of random interlacements
• Mean-field critical behaviour for percolation in high dimensions
• Surface order large deviations for Ising, Potts and percolation models
• Upper bound on the disconnection time of discrete cylinders and random interlacements
• Percolation on finite graphs and isoperimetric inequalities.
• On the critical parameter of interlacement percolation in high dimension
• Random walks on discrete cylinders with large bases and random interlacements
• Random Walks in Multidimensional Spaces, Especially on Periodic Lattices
• Percolation in high dimensions
• Giant vacant component left by a random walk in a random \(d\)-regular graph
• Percolation in High Dimensions

Cited In (6)

• On the \(C^1\)-property of the percolation function of random interlacements and a related variational problem
• Transience of the vacant set for near-critical random interlacements in high dimensions
• Title not available (Why is that?)
• Russo's formula for random interlacements
• Soft local times and decoupling of random interlacements
• On the percolative properties of the intersection of two independent interlacements

This page was built for publication: A lower bound on the critical parameter of interlacement percolation in high dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q718896)