The size of a pond in 2D invasion percolation
Probability
2011-01-10 v1
Abstract
We consider invasion percolation on the square lattice. It has been proved by van den Berg, Peres, Sidoravicius and Vares, that the probability that the radius of a so-called pond is larger than n, differs at most a factor of order log n from the probability that in critical Bernoulli percolation the radius of an open cluster is larger than n. We show that these two probabilities are, in fact, of the same order. Moreover, we prove an analogous result for the volume of a pond.
Keywords
Cite
@article{arxiv.0708.4369,
title = {The size of a pond in 2D invasion percolation},
author = {Jacob van den Berg and Antal A. Járai and Bálint Vágvölgyi},
journal= {arXiv preprint arXiv:0708.4369},
year = {2011}
}
Comments
11 pages