Abstract
We consider the standard site percolation model on the three dimensional cubic lattice. Starting solely with the hypothesis that , we prove that, for any , there exists such that, with probability larger than , every pair of vertices inside the box are joined by a path having at most closed sites.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.