Indexing metadata

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


 
Dublin Core PKP Metadata Items Metadata for this Document
 
1. Title Title of document The gaps between the sizes of large clusters in 2D critical percolation
 
2. Creator Author's name, affiliation, country Jacob van den Berg; Centrum Wiskunde & Informatica; Netherlands
 
2. Creator Author's name, affiliation, country Rene Conijn; VU University Amsterdam; Netherlands
 
3. Subject Discipline(s)
 
3. Subject Keyword(s) Critical percolation, cluster size
 
3. Subject Subject classification 60K35
 
4. Description Abstract

Consider critical bond percolation on a large $2 n \times 2 n$ 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.

Jàrai 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.
 
5. Publisher Organizing agency, location
 
6. Contributor Sponsor(s)
 
7. Date (YYYY-MM-DD) 2013-12-10
 
8. Type Status & genre Peer-reviewed Article
 
8. Type Type
 
9. Format File format PDF
 
10. Identifier Uniform Resource Identifier http://ecp.ejpecp.org/article/view/3065
 
10. Identifier Digital Object Identifier 10.1214/ECP.v18-3065
 
11. Source Journal/conference title; vol., no. (year) Electronic Communications in Probability; Vol 18
 
12. Language English=en en
 
14. Coverage Geo-spatial location, chronological period, research sample (gender, age, etc.)
 
15. Rights Copyright and permissions The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.

Summary of the Creative Commons Attribution License

You are free
  • to copy, distribute, display, and perform the work
  • to make derivative works
  • to make commercial use of the work
under the following condition of Attribution: others must attribute the work if displayed on the web or stored in any electronic archive by making a link back to the website of EJP via its Digital Object Identifier (DOI), or if published in other media by acknowledging prior publication in this Journal with a precise citation including the DOI. For any further reuse or distribution, the same terms apply. Any of these conditions can be waived by permission of the Corresponding Author.