Abstract. We study the problem of coexistence in a two-type competition model governed by first-passage percolation on Zd or on the infinite cluster in Bernoulli percolation. We prove for a large class of ergodic stationary passage times that for distinct points x, y ∈ Zd, there is a strictly positive probability that {z ∈ Zd; d(y, z) < d(x, z)} and {z ∈ 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 for independent exponential times on the square lattice. 1
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
We prove non-universality results for first-passage percolation on the configuration model with i.i....
In this thesis we introduce and study two probabilistic models of competition and their applications...
Abstract. We study the problem of coexistence in a two-type competition model governed by first-pass...
We study a natural growth process with competition, which was recently introduced to analyze MDLA, a...
Let #mu#(F) be the time constant of first-passage percolation on the square lattice with underlying ...
AbstractWe consider a two-type stochastic competition model on the integer lattice Zd. The model des...
34 pages, 4 figuresWe consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we ...
International audienceConsider first passage percolation on $\mathbb{Z}^d$ with passage times given ...
We consider the first passage percolation model on Z2. In this model, we assign independently to eac...
International audienceWe give the first properties of independent Bernoulli percolation, for oriente...
AbstractWe consider the first passage percolation model on the Zd lattice. In this model, we assign ...
In this paper we investigate first passage percolation on an inhomogeneous random graph model introd...
This paper presents three results on dependent site percolation on the square lattice. First, there ...
We propose two models of the evolution of a pair of competing populations. Both are lattice based. T...
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
We prove non-universality results for first-passage percolation on the configuration model with i.i....
In this thesis we introduce and study two probabilistic models of competition and their applications...
Abstract. We study the problem of coexistence in a two-type competition model governed by first-pass...
We study a natural growth process with competition, which was recently introduced to analyze MDLA, a...
Let #mu#(F) be the time constant of first-passage percolation on the square lattice with underlying ...
AbstractWe consider a two-type stochastic competition model on the integer lattice Zd. The model des...
34 pages, 4 figuresWe consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we ...
International audienceConsider first passage percolation on $\mathbb{Z}^d$ with passage times given ...
We consider the first passage percolation model on Z2. In this model, we assign independently to eac...
International audienceWe give the first properties of independent Bernoulli percolation, for oriente...
AbstractWe consider the first passage percolation model on the Zd lattice. In this model, we assign ...
In this paper we investigate first passage percolation on an inhomogeneous random graph model introd...
This paper presents three results on dependent site percolation on the square lattice. First, there ...
We propose two models of the evolution of a pair of competing populations. Both are lattice based. T...
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
We prove non-universality results for first-passage percolation on the configuration model with i.i....
In this thesis we introduce and study two probabilistic models of competition and their applications...