The lowest crossing in 2D critical percolation
J. van den Berg, A. A. Jarai
Abstract
We study the following problem for critical site percolation on the triangular lattice. Let A and B be sites on a horizontal line e separated by distance n. Consider, in the half-plane above e, the lowest occupied crossing R from the half-line left of A to the half-line right of B. We show that the probability that R has a site at distance smaller than m from AB is of order (log (n/m))-1, uniformly in 1 <= m < n/2. Much of our analysis can be carried out for other two-dimensional lattices as well.
Create a lesson
Related papers
Sublinear multi-type preferential attachment
Anna Ben-Hamou, Nicolas Broutin, Camille Cazaux
Uniform Central Limit Theorems for Degree Distributions of Sparse Graphon Models
Robert Lunde, Soumendra Lahiri
Matching Random Point Sets with Minimum Distortion
Itai Benjamini, Mark Braverman, Elad Tzalik et al.
Uniqueness and full coverage in k-neighbor graphs
David Coupier, Benoît Henry, Benedikt Jahnel et al.
Bass martingales need not stretch
Mathias Beiglböck, Manuel Hasenbichler, Gudmund Pammer
Universality of smallest singular values of random row submatrices and phase retrieval problems
Shu Wen, Christian E. Häggblom, Xiufan Yang