Abstract
We consider the first passage percolation problem on the random graph with vertex set N x {0, 1}, edges joining vertices at a Euclidean distance equal to unity, and independent exponential edge weights. We provide a central limit theorem for the first passage times ln between the vertices (0, 0) and (n, 0), thus extending earlier results about the almost-sure convergence of ln / n as n → ∞. We use generating function techniques to compute the n-step transition kernels of a closely related Markov chain which can be used to explicitly calculate the asymptotic variance in the central limit theorem.
Citation
Eckhard Schlemm. "On the Markov transition kernels for first passage percolation on the ladder." J. Appl. Probab. 48 (2) 366 - 388, June 2011. https://doi.org/10.1239/jap/1308662633
Information