A lower bound on the critical parameter of interlacement percolation in high dimension
From MaRDI portal
(Redirected from Publication:718896)
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.
Recommendations
- On the critical parameter of interlacement percolation in high dimension
- A short proof of the phase transition for the vacant set of random interlacements
- Percolation for the vacant set of random interlacements
- Vacant set of random interlacements and percolation
- Transience of the vacant set for near-critical random interlacements in high dimensions
Cites work
- scientific article; zbMATH DE number 3936137 (Why is no real title available?)
- scientific article; zbMATH DE number 3482903 (Why is no real title available?)
- scientific article; zbMATH DE number 201032 (Why is no real title available?)
- scientific article; zbMATH DE number 4197122 (Why is no real title available?)
- Domination by product measures
- Edge-isoperimetric inequalities in the grid
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- Interlacement percolation on transient weighted graphs
- Mean-field critical behaviour for percolation in high dimensions
- On the critical parameter of interlacement percolation in high dimension
- On the domination of a random walk on a discrete cylinder by random interlacements
- Percolation for the vacant set of random interlacements
- Percolation in High Dimensions
- Percolation in high dimensions
- Percolation on finite graphs and isoperimetric inequalities.
- Random Walks in Multidimensional Spaces, Especially on Periodic Lattices
- Random walk on a discrete torus and random interlacements
- Random walks on discrete cylinders and random interlacements
- Random walks on discrete cylinders with large bases and random interlacements
- Surface order large deviations for Ising, Potts and percolation models
- Upper bound on the disconnection time of discrete cylinders and random interlacements
- Vacant set of random interlacements and percolation
Cited in
(13)- Russo's formula for random interlacements
- Vacant set of random interlacements and percolation
- On the percolative properties of the intersectionof two independent interlacements
- Local percolative properties of the vacant set of random interlacements with small intensity
- Continuity and uniqueness of percolation critical parameters in finitary random interlacements
- scientific article; zbMATH DE number 1839487 (Why is no real title available?)
- 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
- Soft local times and decoupling of random interlacements
- The chemical distance in random interlacements in the low-intensity regime
- First passage percolation, local uniqueness for interlacements and capacity of random walk
- On the critical parameter of interlacement percolation in high dimension
- Decoupling inequalities and interlacement percolation on \(G\times \mathbb Z\)
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)
