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

First Passage Percolation with nonidentical passage times (1409.2602v1)

Published 9 Sep 2014 in math.PR

Abstract: In this paper we consider first passage percolation on the square lattice (\mathbb{Z}d) with passage times that are independent and have bounded (p{th}) moment for some (p > 6(1+d),) but not necessarily identically distributed. For integer (n \geq 1,) let (T(0,n)) be the minimum time needed to reach the point ((n,\mathbf{0})) from the origin. We prove that (\frac{1}{n}\left(T(0,n) - \mathbb{E}T(0,n)\right)) converges to zero in (L2) and use a subsequence argument to obtain almost sure convergence. As a corollary, for i.i.d. passage times, we also obtain the usual almost sure convergence of (\frac{T(0,n)}{n}) to a constant (\mu.)

Summary

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