On percolation of two-dimensional hard disks
arXiv:1709.03111 · doi:10.1007/s00220-018-3193-x
Abstract
We consider the hard-core model in , in which a random set of non-intersecting unit disks is sampled with an intensity parameter . Given we consider the graph in which two disks are adjacent if they are at distance from each other. We prove that this graph, , is highly connected when is greater than a certain threshold depending on . Namely, given a square annulus with inner radius and outer radius , the probability that the annulus is crossed by is at least . As a corollary we prove that a Gibbs state admits an infinite component of if the intensity is large enough, depending on .
arXiv comment49 pages
References in corpus (7)
- New upper bounds on sphere packings I
- The sphere packing problem in dimension 24
- The sphere packing problem in dimension 8
- New upper bounds on sphere packings II
- Improved Peierls Argument for High Dimensional Ising Models
- Translation-invariance of two-dimensional Gibbsian point processes
- Percolation of hard disks