On the time constant of high dimensional first passage percolation, revisited
Antonio Auffinger, Si Tang

TL;DR
This paper revisits the asymptotic behavior of the time constant in high-dimensional first passage percolation, correcting a previous proof and establishing new bounds, with implications for variance estimates in exponential cases.
Contribution
It provides a new approach to establish the upper bound of the time constant's asymptotics and analyzes variance in the exponential case, correcting prior inaccuracies.
Findings
Established the upper bound of the time constant in high dimensions.
Proved the variance of the passage time is of smaller order in exponential cases.
Corrected the proof of a key asymptotic inequality in first passage percolation.
Abstract
In [2], it was claimed that the time constant for the first-passage percolation model on is as , if the passage times are i.i.d., with a common c.d.f. satisfying for some constants and sufficiently small . However, the proof of the upper bound, namely, Equation (2.1) in [2] \begin{align} \limsup_{d\to\infty} \frac{\mu_{d}(e_{1})ad}{\log d} \le \frac{1}{2} \end{align} is incorrect. In this article, we provide a different approach that establishes this inequality. As a side product of this new method, we also show that the variance of the non-backtracking passage time to the first hyperplane is of order as in the case of the when the edge weights are exponentially…
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 · Random Matrices and Applications · Complex Network Analysis Techniques
