AbstractConsider the following bond percolation process on Z2: each vertex x∈Z2 is connected to each of its nearest neighbour in the vertical direction with probability pv=ε>0; and in the horizontal direction each vertex x∈Z2 is connected to each of the vertices x±(i,0) with probability pi⩾0,i⩾1, with all different connections being independent. We prove that if pi's satisfy some regularity property, namely if pi⩾1/ilni, for i sufficiently large, then for each ε>0 there exists K≡K(ε) such that for truncated percolation process (for which p̃i=pi if i⩽K and p̃j=0 if j>K) the probability of the open cluster of the origin to be infinite remains positive
In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoper...
11 pInternational audienceRecently, by introducing the notion of cumulatively merged partition, M\'...
Given $\lambda > 0$, $p\in [0,1]$ and a Poisson Point Process $\mathrm{Po}(\lambda)$ in $\mathbb R^2...
AbstractConsider the following bond percolation process on Z2: each vertex x∈Z2 is connected to each...
AbstractConsider an independent site percolation model with parameter p∈(0,1) on Zd,d≥2, where there...
We consider an independent long-range bond percolation on Z2. Horizontal and vertical bonds of lengt...
We consider different problems within the general theme of long-range percolation on oriented graphs...
In this article, we consider an anisotropic finite-range bond percolation model on Z(2). On each hor...
We consider oriented long-range percolation on a graph with vertex set Zd×Z+ and directed edges of t...
We study the phase transition phenomena for long-range oriented percolation and contact process. We ...
We investigate the problem of percolation of words in a random environment. To each vertex, we indep...
Abstract We formulate and study a model for inhomogeneous long-range percolation on Zd. Each vertex ...
AbstractIn 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation ...
In 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation in Zn is...
Percolation theory is the study of the behaviour of connected clusters in a randomgraph. Due not onl...
In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoper...
11 pInternational audienceRecently, by introducing the notion of cumulatively merged partition, M\'...
Given $\lambda > 0$, $p\in [0,1]$ and a Poisson Point Process $\mathrm{Po}(\lambda)$ in $\mathbb R^2...
AbstractConsider the following bond percolation process on Z2: each vertex x∈Z2 is connected to each...
AbstractConsider an independent site percolation model with parameter p∈(0,1) on Zd,d≥2, where there...
We consider an independent long-range bond percolation on Z2. Horizontal and vertical bonds of lengt...
We consider different problems within the general theme of long-range percolation on oriented graphs...
In this article, we consider an anisotropic finite-range bond percolation model on Z(2). On each hor...
We consider oriented long-range percolation on a graph with vertex set Zd×Z+ and directed edges of t...
We study the phase transition phenomena for long-range oriented percolation and contact process. We ...
We investigate the problem of percolation of words in a random environment. To each vertex, we indep...
Abstract We formulate and study a model for inhomogeneous long-range percolation on Zd. Each vertex ...
AbstractIn 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation ...
In 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation in Zn is...
Percolation theory is the study of the behaviour of connected clusters in a randomgraph. Due not onl...
In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoper...
11 pInternational audienceRecently, by introducing the notion of cumulatively merged partition, M\'...
Given $\lambda > 0$, $p\in [0,1]$ and a Poisson Point Process $\mathrm{Po}(\lambda)$ in $\mathbb R^2...