The expected number of critical percolation clusters intersecting a line segment
Electronic Communications in Probability , Volume 21 p. 28
We study critical percolation on a regular planar lattice. Let EG(n) be the expected number of open clusters intersecting or hitting the line segment [0, n]. (For the subscript G we either take ℍ(when we restrict to the upper halfplane, or ℂ, when we consider the full lattice). Cardy  (see also Yu, Saleur and Haas ) derived heuristically that Eℍ((n) =An +√3/4π log(n) + o(log(n)), where A is some constant. Recently Kovács, Iglói and Cardy derived in  heuristically (as a special case of a more general formula) that a similar result holds for Eℂ(n) with the constant √3/4π replaced by 5√3/32π. In this paper we give, for site percolation on the triangular lattice, a rigorous proof for the formula of Eℍ(n) above, and a rigorous upper bound for the prefactor of the logarithm in the formula of Eℂ(n).
|Electronic Communications in Probability|
van den Berg, J, & Conijn, R.P. (2016). The expected number of critical percolation clusters intersecting a line segment. Electronic Communications in Probability, 21. doi:10.1214/16-ECP4452