scholarly journals Long paths in first passage percolation on the complete graph I. Local PWIT dynamics

2020 ◽  
Vol 25 (0) ◽  
Author(s):  
Maren Eckhoff ◽  
Jesse Goodman ◽  
Remco van der Hofstad ◽  
Francesca R. Nardi
Keyword(s):  
Complete Graph ◽  
First Passage Percolation ◽  
First Passage ◽  
Long Paths

scholarly journals Long Paths in First Passage Percolation on the Complete Graph II. Global Branching Dynamics

2020 ◽  
Vol 181 (2) ◽  
pp. 364-447
Author(s):  
Maren Eckhoff ◽  
Jesse Goodman ◽  
Remco van der Hofstad ◽  
Francesca R. Nardi
Keyword(s):  
Complete Graph ◽  
First Passage Percolation ◽  
First Passage ◽  
Long Paths

scholarly journals Short Paths for First Passage Percolation on the Complete Graph

2013 ◽  
Vol 151 (6) ◽  
pp. 1056-1088 ◽  
Author(s):  
Maren Eckhoff ◽  
Jesse Goodman ◽  
Remco van der Hofstad ◽  
Francesca R. Nardi
Keyword(s):  
Complete Graph ◽  
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.

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.

scholarly journals A random hierarchical lattice: the series-parallel graph and its properties

2004 ◽  
Vol 36 (03) ◽  
pp. 824-838 ◽  
Author(s):  
B. M. Hambly ◽  
Jonathan Jordan
Keyword(s):  
Phase Transition ◽  
Random Graphs ◽  
Effective Resistance ◽  
First Passage Percolation ◽  
Hierarchical Lattice ◽  
First Passage ◽  
In Series ◽  
Parallel Graph

We consider a sequence of random graphs constructed by a hierarchical procedure. The construction replaces existing edges by pairs of edges in series or parallel with probability p. We investigate the effective resistance across the graphs, first-passage percolation on the graphs and the Cheeger constants of the graphs as the number of edges tends to infinity. In each case we find a phase transition at

Sign in / Sign up

Export Citation Format

Share Document