Two infinite 0–1 sequences are called compatible when it is possible to cast out $0\,$s from both in such a way that they become complementary to each other. Answering a question of Peter Winkler, we show that if the two 0–1 sequences are random i.i.d. and independent from each other, with probability $p$ of $1\,$s, then if $p$ is sufficiently small they are compatible with positive probability. The question is equivalent to a certain dependent percolation with a power-law behaviour: the probability that the origin is blocked at distance $n$ but not closer decreases only polynomially fast and not, as usual, exponentially
We address the dynamics of two indistinguishable interacting particles moving on a dynamical percol...
International audienceThe aim of this paper is to underline the relation between re-versible growth ...
In the two-type Richardson model on a graph G=(V,E), each vertex is at a given time in state 0,1 or ...
Two infinite walks on the same finite graph are called compatible if it is possible to introduce del...
submitted 18 dec 2003We study the problem of coexistence in a two-type competition model governedby ...
Consider the integer lattice L = ℤ2. For some m [ges ] 4, let us colour each column of this lattice ...
Winkler percolations, also known as coordinate percolations, are digraphs generated by random 0-1 se...
More than twenty years ago Peter Winkler introduced a fascinating class of dependent or “co-ordinate...
Limit theorems are ubiquitous in probability theory. The present work samples contributionsof the au...
38 pages, 2 figuresInternational audienceConsider two epidemics whose expansions on $\mathbb{Z}^d$ a...
For a natural number k, define an oriented site percolation on ℤ2 as follows. Let xi, yj be independ...
Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered pr...
AbstractIn this paper we discuss three notions of partial randomness or ε-randomness. ε-randomness s...
We explicitly construct a stationary coupling attaining Ornstein's d̄-distance between ordered pairs...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
We address the dynamics of two indistinguishable interacting particles moving on a dynamical percol...
International audienceThe aim of this paper is to underline the relation between re-versible growth ...
In the two-type Richardson model on a graph G=(V,E), each vertex is at a given time in state 0,1 or ...
Two infinite walks on the same finite graph are called compatible if it is possible to introduce del...
submitted 18 dec 2003We study the problem of coexistence in a two-type competition model governedby ...
Consider the integer lattice L = ℤ2. For some m [ges ] 4, let us colour each column of this lattice ...
Winkler percolations, also known as coordinate percolations, are digraphs generated by random 0-1 se...
More than twenty years ago Peter Winkler introduced a fascinating class of dependent or “co-ordinate...
Limit theorems are ubiquitous in probability theory. The present work samples contributionsof the au...
38 pages, 2 figuresInternational audienceConsider two epidemics whose expansions on $\mathbb{Z}^d$ a...
For a natural number k, define an oriented site percolation on ℤ2 as follows. Let xi, yj be independ...
Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered pr...
AbstractIn this paper we discuss three notions of partial randomness or ε-randomness. ε-randomness s...
We explicitly construct a stationary coupling attaining Ornstein's d̄-distance between ordered pairs...
14 pagesWe pursue the study of a random coloring first passage percolation model introduced by Fonte...
We address the dynamics of two indistinguishable interacting particles moving on a dynamical percol...
International audienceThe aim of this paper is to underline the relation between re-versible growth ...
In the two-type Richardson model on a graph G=(V,E), each vertex is at a given time in state 0,1 or ...