The travel time in a finite box in supercritical Bernoulli percolation

preprint2013arXivOpen access

Abstract

We consider the standard site percolation model on the three dimensional cubic lattice. Starting solely with the hypothesis that θ(p)>0θ(p)>0, we prove that, for any α>0α>0, there exists κ>0κ>0 such that, with probability larger than 1−1/nα1-1/n^α, every pair of vertices inside the box Λ(n)Λ(n) are joined by a path having at most κ(ln⁡n)2κ(\ln n)^2 closed sites.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.