Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 1 Mar 2010 in math.PR, math-ph, and math.MP | (1003.0334v1)

Abstract: We investigate the percolative properties of the vacant set left by random interlacements on Zd, when d is large. A non-negative parameter u controls the density of random interlacements on Zd. 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 Zd, 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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.