Asymptotics for first-passage percolation on logarithmic subgraphs of $\mathbb{Z}^2$
Michael Damron, Wai-Kit Lam

TL;DR
This paper investigates first-passage percolation on specific logarithmic subgraphs of ^2, revealing how passage times grow and phase transition properties depend on parameters, with new limit theorems and improved percolation transition criteria.
Contribution
It provides new asymptotic growth rates for passage times, establishes a central limit theorem for general functions, and refines criteria for discontinuous phase transitions on these subgraphs.
Findings
Passage time growth rate is order n/(a log n) at p=1/2.
For p>1/2, passage times can grow as n^{c_1}/( ext{log} n)^{c_2}, ( ext{log} n)^{c_3}, ext{log} ext{log} n, or constant.
Percolation phase transition is discontinuous if and only if b > a.
Abstract
For and , let be the subgraph of induced by the vertices between the first coordinate axis and the graph of the function , . It is known that for , the critical value for Bernoulli percolation on is strictly between and , and that if then the percolation phase transition is discontinuous. We study first-passage percolation (FPP) on with i.i.d. edge-weights satisfying and the "gap condition" for some . We find the rate of growth of the expected passage time in from the origin to the line , and show that, while when it is of order , when it can be of order (a)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Random Matrices and Applications
