International audienceFor First Passage Percolation in Z^d with large d, we construct a path connecting the origin to {x_1 =1}, whose passage time has optimal order \log d/d. Besides, an improved lower bound for the "diagonal" speed of the cluster combined with a result by Dhar (1988) shows that the limiting shape in FPP with exponential passage times (and thus that of Eden model) is not the euclidian ball in dimension larger than 35
We consider first passage percolation on a d-dimensional hypercubical lattice. The passage time for ...
In this thesis, we consider two percolation models on the n-dimensional binary hypercube, known as a...
We study first-passage percolation on $\mathbb Z^d$, $d\ge 2$, with independent weights whose common...
For First Passage Percolation in Zd with large d, we construct a path connecting the origin to {x1 =...
AbstractWe consider standard first passage percolation on Zd: {x(e): e an edge of Zd} is i.i.d. fami...
The n-dimensional binary hypercube is the graph whose vertices are the binary n-tuples {0,1)(n) and ...
We study the paths of minimal cost for first-passage percolation in two dimensions and obtain an exp...
International audienceWe prove consistency of four different approaches to formalizing the idea of m...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
peer reviewedWe consider a model of first passage percolation (FPP) where the nearest-neighbor edges...
In first-passage percolation, one places nonnegative i.i.d. random variables (T (e)) on the edges of...
We consider the standard model of i.i.d. first passage percolation on Z^d given a distribution G on ...
International audienceConsider first passage percolation on $\mathbb{Z}^d$ with passage times given ...
We consider a last-passage directed percolation model in $Z_+^2$, with i.i.d. weights whose common d...
We prove a strong law of large numbers for directed last passage times in an independent but inhomog...
We consider first passage percolation on a d-dimensional hypercubical lattice. The passage time for ...
In this thesis, we consider two percolation models on the n-dimensional binary hypercube, known as a...
We study first-passage percolation on $\mathbb Z^d$, $d\ge 2$, with independent weights whose common...
For First Passage Percolation in Zd with large d, we construct a path connecting the origin to {x1 =...
AbstractWe consider standard first passage percolation on Zd: {x(e): e an edge of Zd} is i.i.d. fami...
The n-dimensional binary hypercube is the graph whose vertices are the binary n-tuples {0,1)(n) and ...
We study the paths of minimal cost for first-passage percolation in two dimensions and obtain an exp...
International audienceWe prove consistency of four different approaches to formalizing the idea of m...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
peer reviewedWe consider a model of first passage percolation (FPP) where the nearest-neighbor edges...
In first-passage percolation, one places nonnegative i.i.d. random variables (T (e)) on the edges of...
We consider the standard model of i.i.d. first passage percolation on Z^d given a distribution G on ...
International audienceConsider first passage percolation on $\mathbb{Z}^d$ with passage times given ...
We consider a last-passage directed percolation model in $Z_+^2$, with i.i.d. weights whose common d...
We prove a strong law of large numbers for directed last passage times in an independent but inhomog...
We consider first passage percolation on a d-dimensional hypercubical lattice. The passage time for ...
In this thesis, we consider two percolation models on the n-dimensional binary hypercube, known as a...
We study first-passage percolation on $\mathbb Z^d$, $d\ge 2$, with independent weights whose common...