A central limit theorem for "critical" first-passage percolation in two dimensions

1997 ◽  
Vol 107 (2) ◽  
pp. 137-160 ◽  
Author(s):  
Harry Kesten ◽  
Yu Zhang
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Two Dimensions ◽  
First Passage Percolation ◽  
First Passage

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

2011 ◽  
Vol 48 (02) ◽  
pp. 366-388 ◽  
Author(s):  
Eckhard Schlemm
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Asymptotic Variance ◽  
Almost Sure Convergence ◽  
First Passage Percolation ◽  
First Passage ◽  
Percolation Problem ◽  
Vertex Set ◽  
Step Transition

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.

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

2011 ◽  
Vol 48 (2) ◽  
pp. 366-388 ◽  
Author(s):  
Eckhard Schlemm
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Asymptotic Variance ◽  
Almost Sure Convergence ◽  
First Passage Percolation ◽  
First Passage ◽  
Percolation Problem ◽  
Vertex Set ◽  
Step Transition

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.

First-passage percolation processes with finite height

1985 ◽  
Vol 22 (4) ◽  
pp. 766-775
Author(s):  
Norbert Herrndorf
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
First Passage Percolation ◽  
Horizontal Strip ◽  
First Passage ◽  
Time Constants ◽  
Finite Height ◽  
Special Cases ◽  
Percolation Processes ◽  
Passage Times

We consider first-passage percolation in an infinite horizontal strip of finite height. Using methods from the theory of Markov chains, we prove a central limit theorem for first-passage times, and compute the time constants for some special cases.

On the exact order of normal approximation in multivariate renewal theory

1985 ◽  
Vol 22 (02) ◽  
pp. 280-287 ◽  
Author(s):  
Ştefan P. Niculescu ◽  
Edward Omey
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Normal Approximation ◽  
Renewal Theory ◽  
Rates Of Convergence ◽  
Partial Sums ◽  
Exact Order ◽  
First Passage ◽  
The Central Limit Theorem

Equivalence of rates of convergence in the central limit theorem for the vector of maximum sums and the corresponding first-passage variables is established. A similar result for the vector of partial sums and the corresponding renewal variables is also given. The results extend to several dimensions the bivariate results of Ahmad (1981).

On the exact order of normal approximation in multivariate renewal theory

1985 ◽  
Vol 22 (2) ◽  
pp. 280-287 ◽  
Author(s):  
Ştefan P. Niculescu ◽  
Edward Omey
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Normal Approximation ◽  
Renewal Theory ◽  
Rates Of Convergence ◽  
Partial Sums ◽  
Exact Order ◽  
First Passage ◽  
The Central Limit Theorem

Equivalence of rates of convergence in the central limit theorem for the vector of maximum sums and the corresponding first-passage variables is established. A similar result for the vector of partial sums and the corresponding renewal variables is also given. The results extend to several dimensions the bivariate results of Ahmad (1981).

First-passage percolation processes with finite height

1985 ◽  
Vol 22 (04) ◽  
pp. 766-775
Author(s):  
Norbert Herrndorf
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
First Passage Percolation ◽  
Horizontal Strip ◽  
First Passage ◽  
Time Constants ◽  
Finite Height ◽  
Special Cases ◽  
Percolation Processes ◽  
Passage Times

We consider first-passage percolation in an infinite horizontal strip of finite height. Using methods from the theory of Markov chains, we prove a central limit theorem for first-passage times, and compute the time constants for some special cases.

Sign in / Sign up

Export Citation Format

Share Document