Law of large numbers for critical first-passage percolation on the triangular lattice

From MaRDI portal
Publication:743095

DOI10.1214/ECP.V19-3268zbMATH Open1315.60114arXiv1310.1247OpenAlexW2060820335MaRDI QIDQ743095FDOQ743095

Chang-long Yao

Publication date: 22 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: We study the site version of (independent) first-passage percolation on the triangular lattice mathbbT. Denote the passage time of the site v in mathbbT by t(v), and assume that P(t(v)=0)=P(t(v)=1)=1/2. Denote by a0,n the passage time from extbf0 to (n,0), and by b0,n the passage time from extbf0 to the halfplane (x,y):xgeqn. We prove that there exists a constant 0<mu<infty such that as nightarrowinfty, a0,n/lognightarrowmu in probability and b0,n/lognightarrowmu/2 almost surely. This result confirms a prediction of Kesten and Zhang (Probab. Theory Relat. Fields extbf{107}: 137--160, 1997). The proof relies on the existence of the full scaling limit of critical site percolation on mathbbT, established by Camia and Newman.


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




Recommendations





Cited In (8)





This page was built for publication: Law of large numbers for critical first-passage percolation on the triangular lattice

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