The gaps between the sizes of large clusters in 2D critical percolation

From MaRDI portal
Publication:743068

DOI10.1214/ECP.V18-3065zbMATH Open1306.60150arXiv1310.2019MaRDI QIDQ743068FDOQ743068


Authors: Jacob van den Berg, R. P. Conijn Edit this on Wikidata


Publication date: 22 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: Consider critical bond percolation on a large 2n by 2n box on the square lattice. It is well-known that the size (i.e. number of vertices) of the largest open cluster is, with high probability, of order n^2 pi(n), where pi(n) denotes the probability that there is an open path from the center to the boundary of the box. The same result holds for the second-largest cluster, the third largest cluster etcetera. Jarai showed that the differences between the sizes of these clusters is, with high probability, at least of order sqrt{n^2 pi(n)}. Although this bound was enough for his applications (to incipient infinite clusters), he believed, but had no proof, that the differences are in fact of the same order as the cluster sizes themselves, i.e. n^2 pi(n). Our main result is a proof that this is indeed the case.


Full work available at URL: https://arxiv.org/abs/1310.2019




Recommendations





Cited In (7)





This page was built for publication: The gaps between the sizes of large clusters in 2D critical percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743068)