Asymptotics for 2D critical and near-critical first-passage percolation

From MaRDI portal
Publication:2334372

DOI10.1007/S00440-019-00908-2zbMATH Open1423.60166arXiv1806.03737OpenAlexW2963661712MaRDI QIDQ2334372FDOQ2334372


Authors: Chang-long Yao Edit this on Wikidata


Publication date: 7 November 2019

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Abstract: We study Bernoulli first-passage percolation (FPP) on the triangular lattice mathbbT in which sites have 0 and 1 passage times with probability p and 1p, respectively. Denote by mathcalCinfty the infinite cluster with 0-time sites when p>pc, where pc=1/2 is the critical probability. Denote by T(0,mathcalCinfty) the passage time from the origin 0 to mathcalCinfty. First we obtain explicit limit theorem for T(0,mathcalCinfty) as psearrowpc. The proof relies on the limit theorem in the critical case, the critical exponent for correlation length and Kesten's scaling relations. Next, for the usual point-to-point passage time a0,n in the critical case, we construct subsequences of sites with different growth rate along the axis. The main tool involves the large deviation estimates on the nesting of CLE6 loops derived by Miller, Watson and Wilson (2016). Finally, we apply the limit theorem for critical Bernoulli FPP to a random graph called cluster graph, obtaining explicit strong law of large numbers for graph distance.


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




Recommendations




Cites Work


Cited In (17)





This page was built for publication: Asymptotics for 2D critical and near-critical first-passage percolation

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