Connections Workshop: Probability and Statistics of Discrete Structures: The time constant of high dimensional first passage percolation, revisited
Presenter
January 23, 2025
Keywords:
- random graphs
- network inference
- phase transitions
- probabilistic combinatorics
- Markov Chain Monte Carlo
MSC:
- 05C80 - Random graphs (graph-theoretic aspects)
Abstract
We prove high-dimensional asymptotics for the time constants in first-passage percolation (FPP) on $\mathbb Z^d$ along all diagonal-like directions $v=(1, 1, .., 1, 0, 0, …, 0)$ of $f(d)$ nonzero entries. We show that the behavior of the time constant is essentially the same as the axis directions if $f(d)=o(d)$ and is characterized by the Lambert W function if $f(d)~\alpha d$. Dhar’s cluster exploration idea was used in proving such results as well as deriving the moments of non-backtracking first-passage times.