Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T18:05:44.881Z Has data issue: false hasContentIssue false

On the Markov Transition Kernels for First Passage Percolation on the Ladder

Published online by Cambridge University Press:  14 July 2016

Eckhard Schlemm*
Affiliation:
Technische Universität München
*
∗ Postal address: TUM Institute for Advanced Study & Zentrum Mathematik, Technische Universität München, Boltzmannstrasse 3, 85748 Garching bei München, Germany. Email address: schlemm@ma.tum.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 l n between the vertices (0, 0) and (n, 0), thus extending earlier results about the almost-sure convergence of l n / 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.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2011