We pursue the study of a random coloring first passage percolation model introduced by Fontes and Newman. We prove that the asymptotic shape of this first passage percolation model continuously depends on the law of the coloring. The proof uses several couplings, particularly with greedy lattice animals
We give a counterexample to a conjecture of Hammersley and Welsh (1965) about the convexity of the t...
ABSTRACT. We consider the first-passage percolation problem on the random graph with vertex set N× {...
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
We consider the standard model of first-passage percolation on $\mathbb{Z}^d$ ($d\geq 2$), with i.i....
We give a counterexample to a conjecture of Hammersley and Welsh (1965) about the convexity of the t...
This thesis combines the study of asymptotic properties of percolation processes with various dynami...
We consider first passage percolation on a d-dimensional hypercubical lattice. The passage time for ...
AbstractWe consider the first passage percolation model on the Zd lattice. In this model, we assign ...
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
International audienceWe consider a non trivial Boolean model $\Sigma$ on ${\mathbb R}^d$ for $d\geq...
Let #mu#(F) be the time constant of first-passage percolation on the square lattice with underlying ...
We study the paths of minimal cost for first-passage percolation in two dimensions and obtain an exp...
34 pages, 4 figuresWe consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we ...
International audienceWe study a random growth model on ${\Bbb R}^{d}$ introduced by Deijfen. This i...
We give a counterexample to a conjecture of Hammersley and Welsh (1965) about the convexity of the t...
ABSTRACT. We consider the first-passage percolation problem on the random graph with vertex set N× {...
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
We consider the standard model of first-passage percolation on $\mathbb{Z}^d$ ($d\geq 2$), with i.i....
We give a counterexample to a conjecture of Hammersley and Welsh (1965) about the convexity of the t...
This thesis combines the study of asymptotic properties of percolation processes with various dynami...
We consider first passage percolation on a d-dimensional hypercubical lattice. The passage time for ...
AbstractWe consider the first passage percolation model on the Zd lattice. In this model, we assign ...
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
International audienceWe consider a non trivial Boolean model $\Sigma$ on ${\mathbb R}^d$ for $d\geq...
Let #mu#(F) be the time constant of first-passage percolation on the square lattice with underlying ...
We study the paths of minimal cost for first-passage percolation in two dimensions and obtain an exp...
34 pages, 4 figuresWe consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we ...
International audienceWe study a random growth model on ${\Bbb R}^{d}$ introduced by Deijfen. This i...
We give a counterexample to a conjecture of Hammersley and Welsh (1965) about the convexity of the t...
ABSTRACT. We consider the first-passage percolation problem on the random graph with vertex set N× {...
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G...
DOI
Add to ORKG