Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a and b be vertices. An earlier paper proved the (nonintuitive) result that, conditioned on the event that there is no open path from s to t, the two events ``there is an open path from s to a' and ``there is an open path from s to b' are positively correlated. In the present paper we further investigate and generalize the theorem of which this result was a consequence. This leads to results saying, informally, that, with the above conditioning, the open cluster of s is conditionally positively (self-)associated and that it is conditionally negatively correlated with the open cluster of t. We also present analogues of some of our results for (a) random-clu...
Abstract. Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertice...
For a natural number k, define an oriented site percolation on ℤ2 as follows. Let xi, yj be independ...
We consider a class of random, weighted networks, obtained through a redefinition of patterns in ...
Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be ve...
It is well-known in percolation theory (and intuitively plausible) that two events of the form ``the...
We study the effect of positive correlations on the critical threshold of site and bond percolation ...
AbstractLet v(A) be the extinction probability for a contact process on a countable set S with initi...
International audienceA useful result about leftmost and rightmost paths in two dimensional bond per...
Ž.Any infinite graph G V, E has a site percolation critical probabil-ity psite and a bond percolati...
. We discuss inequalities and applications for percolation and randomcluster models. The relevant ar...
We study bond percolation evolving in time in such a way that the edges turn on and off independentl...
In this licentiate thesis, inference in a partially oberved percolation process living on a graph, i...
We prove that in a random tournament the events $\{s\rightarrow a\}$ (meaning that there is a direct...
Abstract We discuss various stochastic models (random walk, percolation, the Ising and random-cluste...
We construct a nearest-neighbor process {Sn} on Z that is less predictable than simple random walk, ...
Abstract. Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertice...
For a natural number k, define an oriented site percolation on ℤ2 as follows. Let xi, yj be independ...
We consider a class of random, weighted networks, obtained through a redefinition of patterns in ...
Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be ve...
It is well-known in percolation theory (and intuitively plausible) that two events of the form ``the...
We study the effect of positive correlations on the critical threshold of site and bond percolation ...
AbstractLet v(A) be the extinction probability for a contact process on a countable set S with initi...
International audienceA useful result about leftmost and rightmost paths in two dimensional bond per...
Ž.Any infinite graph G V, E has a site percolation critical probabil-ity psite and a bond percolati...
. We discuss inequalities and applications for percolation and randomcluster models. The relevant ar...
We study bond percolation evolving in time in such a way that the edges turn on and off independentl...
In this licentiate thesis, inference in a partially oberved percolation process living on a graph, i...
We prove that in a random tournament the events $\{s\rightarrow a\}$ (meaning that there is a direct...
Abstract We discuss various stochastic models (random walk, percolation, the Ising and random-cluste...
We construct a nearest-neighbor process {Sn} on Z that is less predictable than simple random walk, ...
Abstract. Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertice...
For a natural number k, define an oriented site percolation on ℤ2 as follows. Let xi, yj be independ...
We consider a class of random, weighted networks, obtained through a redefinition of patterns in ...