Answers are grounded in this paper and cite their sources.
We consider the standard first-passage percolation problem on Zᵈ: (e): e an edge of Zᵈ\ is an i.i.d. family of random variables with common distribution F, a0,n := inf\∑ᵏ₁ t(e₁): (e₁, ⋯, eₖ) a path on Zᵈ from 0 to n ξ₁\, where ξ₁ is the first coordinate vector. We show that σ²(a0,n) ≤ C₁ n and that P\|a0,n - Ea0,n| ≥ x√n\ ≤ C₂ exp(-C₃ x) for x ≤ C₄ n and for some constants 0 < Cᵢ < ∞. It is known that μ := lim(1/n)Ea0,n exists. We show also that C₅ n⁻¹ ≤ Ea0,n - nμ ≤ C₆ n5/6(log n)1/3. There are corresponding statements for the roughness of the boundary of the set B̃(t) = \ν: ν a vertex of Zᵈ that can be reached from the origin by a path (e₁, ⋯, eₖ) with ∑ t(eᵢ) ≤ t\.
No takes yet. Share an insight, caveat, or question.
Harry Kesten (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: