AbstractWe consider standard first passage percolation on Zd: {x(e): e an edge of Zd} is i.i.d. family of random variables with distribution F. Denote by a0,n the first passage time from the origin to (n, 0, …, 0). We show that there exists a path called a route with passage time a0,n if F(0) > pc. Indeed, we can show that if F(0) > pc, any route of a0,n has to stay in the infinite cluster B with X(e) = 0 except a few edges. We also show that if F(0) > pc, lim Ea0,n = ϱ(F) exists
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
We give a counterexample to a conjecture of Hammersley and Welsh (1965) about the convexity of the t...
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube...
We consider the first passage percolation model on Z2. In this model, we assign independently to eac...
Let #mu#(F) be the time constant of first-passage percolation on the square lattice with underlying ...
International audienceFor First Passage Percolation in Z^d with large d, we construct a path connect...
34 pages, 4 figuresWe consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we ...
We study the random geometry of first passage percolation on the complete graph equipped with indepe...
We construct a nearest-neighbor process {Sn} on Z that is less predictable than simple random walk, ...
peer reviewedWe consider a model of first passage percolation (FPP) where the nearest-neighbor edges...
The n-dimensional binary hypercube is the graph whose vertices are the binary n-tuples {0,1)(n) and ...
International audienceConsider first passage percolation on $\mathbb{Z}^d$ with passage times given ...
We consider first passage percolation on the conguration model with n vertices, and general independ...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
In this paper we explore ¿rst passage percolation (FPP) on the Erdös-Rényi random graph Gn(pn), wher...
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
We give a counterexample to a conjecture of Hammersley and Welsh (1965) about the convexity of the t...
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube...
We consider the first passage percolation model on Z2. In this model, we assign independently to eac...
Let #mu#(F) be the time constant of first-passage percolation on the square lattice with underlying ...
International audienceFor First Passage Percolation in Z^d with large d, we construct a path connect...
34 pages, 4 figuresWe consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we ...
We study the random geometry of first passage percolation on the complete graph equipped with indepe...
We construct a nearest-neighbor process {Sn} on Z that is less predictable than simple random walk, ...
peer reviewedWe consider a model of first passage percolation (FPP) where the nearest-neighbor edges...
The n-dimensional binary hypercube is the graph whose vertices are the binary n-tuples {0,1)(n) and ...
International audienceConsider first passage percolation on $\mathbb{Z}^d$ with passage times given ...
We consider first passage percolation on the conguration model with n vertices, and general independ...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
In this paper we explore ¿rst passage percolation (FPP) on the Erdös-Rényi random graph Gn(pn), wher...
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
We give a counterexample to a conjecture of Hammersley and Welsh (1965) about the convexity of the t...
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube...