The lowest crossing in two-dimensional critical percolation

DOI10.1214/AOP/1055425778zbMATH Open1087.60076arXivmath/0201030OpenAlexW2141576341MaRDI QIDQ1431486FDOQ1431486

Jacob van den Berg, A. A. Járai

Publication date: 10 June 2004

Published in: The Annals of Probability (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0201030

zbMATH Keywords

critical exponent

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Cites Work

• Title not available (Why is that?)
• Scaling limits of loop-erased random walks and uniform spanning trees
• Critical exponents for two-dimensional percolation
• Critical percolation in the plane: Conformal invariance, Cardy's formula, scaling limits
• Percolation
• A note on percolation
• Percolation Probabilities on the Square Lattice
• One-arm exponent for critical 2D percolation
• On the critical percolation probabilities
• Almost all words are seen in critical site percolation on the triangular lattice

Cited In (3)

• On crossing event formulas in critical two-dimensional percolation
• Boundary proximity of SLE
• Random graph asymptotics on high-dimensional tori

This page was built for publication: The lowest crossing in two-dimensional critical percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1431486)