The expected number of critical percolation clusters intersecting a line segment
arXiv:1505.08046 · doi:10.1214/16-ECP4452
Abstract
We study critical percolation on a regular planar lattice. Let be the expected number of open clusters intersecting or hitting the line segment . (For the subscript we either take , when we restrict to the upper halfplane, or , when we consider the full lattice). Cardy (2001) (see also Yu, Saleur and Haas (2008)) derived heuristically that , where is some constant. Recently Kovács, Iglói and Cardy (2012) derived heuristically (as a special case of a more general formula) that a similar result holds for with the constant replaced by . In this paper we give, for site percolation on the triangular lattice, a rigorous proof for the formula of above, and a rigorous upper bound for the prefactor of the logarithm in the formula of .
arXiv commentFinal version, appeared in Elect.Comm.Probab. 21 (2016)
References in corpus (8)
- Critical Percolation in Finite Geometries
- A crossing probability for critical percolation in two dimensions
- Entanglement Entropy in the Two-Dimensional Random Transverse Field Ising Model
- Excursion decompositions for $\SLE$ and Watts' crossing formula
- Conformal Invariance and Percolation
- Percolation Crossing Formulas and Conformal Field Theory
- Schramm's proof of Watts' formula
- Corner contribution to percolation cluster numbers