submitted 18 dec 2003We study the problem of coexistence in a two-type competition model governedby first-passage percolation on $\Zd$ or on the infinite cluster in Bernoulli percolation.Actually, we prove for a large class of ergodic stationary passage times that for distinct points $x,y\in\Zd$, there is a strictly positive probability that$\{z\in\Zd;d(y,z)d(x,z)\}$ are both infinite sets.We also show that there is a strictly positive probability that the graph of time-minimizing path from the origin in first-passage percolation has at least two topological ends. This generalizes results obtained by H{ä}ggstr{ö}m and Pemantle forindependent exponential times on the square lattice
International audienceThe aim of this paper is to underline the relation between re-versible growth ...
International audienceConsider first passage percolation on $\mathbb{Z}^d$ with passage times given ...
This paper presents three results on dependent site percolation on the square lattice. First, there ...
Abstract. We study the problem of coexistence in a two-type competition model governed by first-pass...
38 pages, 2 figuresInternational audienceConsider two epidemics whose expansions on $\mathbb{Z}^d$ a...
AbstractWe consider a two-type stochastic competition model on the integer lattice Zd. The model des...
We study a natural growth process with competition, which was recently introduced to analyze MDLA, a...
In the two-type Richardson model on a graph G=(V,E), each vertex is at a given time in state 0,1 or ...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
Some examples of translation invariant site percolation processes on the $Z^2$ lattice are construct...
Two infinite walks on the same finite graph are called compatible if it is possible to introduce del...
We study the paths of minimal cost for first-passage percolation in two dimensions and obtain an exp...
Two infinite 0–1 sequences are called compatible when it is possible to cast out $0\,$s from both in...
A two-type version of the frog model on Z^d is formulated, where active type i particles move accord...
We propose two models of the evolution of a pair of competing populations. Both are lattice based. T...
International audienceThe aim of this paper is to underline the relation between re-versible growth ...
International audienceConsider first passage percolation on $\mathbb{Z}^d$ with passage times given ...
This paper presents three results on dependent site percolation on the square lattice. First, there ...
Abstract. We study the problem of coexistence in a two-type competition model governed by first-pass...
38 pages, 2 figuresInternational audienceConsider two epidemics whose expansions on $\mathbb{Z}^d$ a...
AbstractWe consider a two-type stochastic competition model on the integer lattice Zd. The model des...
We study a natural growth process with competition, which was recently introduced to analyze MDLA, a...
In the two-type Richardson model on a graph G=(V,E), each vertex is at a given time in state 0,1 or ...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
Some examples of translation invariant site percolation processes on the $Z^2$ lattice are construct...
Two infinite walks on the same finite graph are called compatible if it is possible to introduce del...
We study the paths of minimal cost for first-passage percolation in two dimensions and obtain an exp...
Two infinite 0–1 sequences are called compatible when it is possible to cast out $0\,$s from both in...
A two-type version of the frog model on Z^d is formulated, where active type i particles move accord...
We propose two models of the evolution of a pair of competing populations. Both are lattice based. T...
International audienceThe aim of this paper is to underline the relation between re-versible growth ...
International audienceConsider first passage percolation on $\mathbb{Z}^d$ with passage times given ...
This paper presents three results on dependent site percolation on the square lattice. First, there ...