Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the time constant of high dimensional first passage percolation, revisited (2501.11589v1)

Published 20 Jan 2025 in math.PR

Abstract: In [2], it was claimed that the time constant $\mu_{d}(e_{1})$ for the first-passage percolation model on $\mathbb Z{d}$ is $\mu_{d}(e_{1}) \sim \log d/(2ad)$ as $d\to \infty$, if the passage times $(\tau_{e}){e\in \mathbb E{d}}$ are i.i.d., with a common c.d.f. $F$ satisfying $\left|\frac{F(x)}{x}-a\right| \le \frac{C}{|\log x|}$ for some constants $a, C$ and sufficiently small $x$. 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 $o\big((\log d/d){2}\big)$ as $d\to \infty$ in the case of the when the edge weights are exponentially distributed.

Summary

We haven't generated a summary for this paper yet.