scholarly journals Asymptotic shape for the chemical distance and first-passage percolation on the infinite Bernoulli cluster

2004 ◽  
Vol 8 ◽  
pp. 169-199 ◽  
Author(s):  
Olivier Garet ◽  
Régine Marchand
Keyword(s):  
First Passage Percolation ◽  
First Passage ◽  
Asymptotic Shape ◽  
Chemical Distance

scholarly journals Regularity of the time constant for a supercritical Bernoulli percolation

2021 ◽  
Author(s):  
Barbara Dembin
Keyword(s):  
Critical Parameter ◽  
Open Cluster ◽  
Passage Time ◽  
Bond Percolation ◽  
First Passage Percolation ◽  
First Passage ◽  
Supercritical Regime ◽  
Regularity Properties ◽  
Chemical Distance ◽  
Special Case

We consider an i.i.d. supercritical bond percolation on Z^d, every edge is open with a probability p > p_c(d), where p_c(d) denotes the critical parameter for this percolation. We know that there exists almost surely a unique infinite open cluster C_p [11]. We are interested in the regularity properties of the chemical distance for supercritical Bernoulli percolation. The chemical distance between two points x, y ∈ C_p corresponds to the length of the shortest path in C_p joining the two points. The chemical distance between 0 and nx grows asymptotically like nµ_p(x). We aim to study the regularity properties of the map p → µ_p in the supercritical regime. This may be seen as a special case of first passage percolation where the distribution of the passage time is G_p = pδ_1 + (1 − p)δ_∞, p > p_c(d). It is already known that the map p → µ_p is continuous (see [10]).

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