arXiv:1005.5696 [math.PR]AbstractReferencesReviewsResources
Limit theorems for 2D invasion percolation
Michael Damron, Artëm Sapozhnikov
Published 2010-05-31, updated 2014-07-03Version 4
We prove limit theorems and variance estimates for quantities related to ponds and outlets for 2D invasion percolation. We first exhibit several properties of a sequence $({\mathbf{O}}(n))$ of outlet variables, the $n$th of which gives the number of outlets in the box centered at the origin of side length $2^n$. The most important of these properties describes the sequence's renewal structure and exponentially fast mixing behavior. We use these to prove a central limit theorem and strong law of large numbers for $({\mathbf{O}}(n))$. We then show consequences of these limit theorems for the pond radii and outlet weights.
Comments: Published in at http://dx.doi.org/10.1214/10-AOP641 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org). Note: the statement of Lemma 3 (which is Theorem 2.1 in Withers (1981)) should include the condition liminf_n b_n^2/n > 0, which is valid in our setting. See the corrigendum to Theorem 2.1 in Withers (1983) in Z. Wahrsch
Journal: Annals of Probability 2012, Vol. 40, No. 3, 893-920
DOI: 10.1214/10-AOP641
Categories: math.PR
Keywords: 2d invasion percolation, sequences renewal structure, central limit theorem, properties, side length
Tags: journal article
Related articles: Most relevant | Search more
arXiv:0905.1297 [math.PR] (Published 2009-05-08)
Central Limit Theorems for Gromov Hyperbolic Groups
arXiv:0708.4369 [math.PR] (Published 2007-08-31)
The size of a pond in 2D invasion percolation
Central Limit Theorem for a Class of Relativistic Diffusions