Abstract. Two vertices x and y are said to be finitely connected if they belong to the same cluster and this cluster is finite. We derive sharp asymptotics (1.2) of finite connections for super-critical Bernoulli bond percolation on Z2. These asymptotics are based on a detailed fluctuation analysis of long finite super-critical clusters or, more precisely, of dual open (sub-critical) loops which surround such clusters
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson ...
The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolat...
We consider an i.i.d. supercritical bond percolation on Z^d , every edge is open with a probability ...
Two vertices x and y are said to be finitely connected if they belong to the same cluster and this c...
We review results of two previous papers on the asymptotic behavior of finite connection probabiliti...
Abstract: The asymptotic behaviour of the connection function for Bernoulli sub-critical percolation...
Scherk's graph is a subgraph of the three-dimensional lattice. It was shown by Markvorsen, McGu...
AbstractLet G be a connected, locally finite, transitive graph, and consider Bernoulli bond percolat...
10 pagesIn this paper, we consider Bernoulli percolation on a locally finite, transitive and infinit...
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meani...
This is the first of two papers on the critical behaviour of bond percolation models in high dimensi...
We prove a local limit theorem for the probability of a site to be connected by disjoint paths to th...
We study bond percolation evolving in time in such a way that the edges turn on and off independentl...
Abstract. The aim of this paper is to extend the well-known asymptotic shape result for first-passag...
Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond pe...
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson ...
The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolat...
We consider an i.i.d. supercritical bond percolation on Z^d , every edge is open with a probability ...
Two vertices x and y are said to be finitely connected if they belong to the same cluster and this c...
We review results of two previous papers on the asymptotic behavior of finite connection probabiliti...
Abstract: The asymptotic behaviour of the connection function for Bernoulli sub-critical percolation...
Scherk's graph is a subgraph of the three-dimensional lattice. It was shown by Markvorsen, McGu...
AbstractLet G be a connected, locally finite, transitive graph, and consider Bernoulli bond percolat...
10 pagesIn this paper, we consider Bernoulli percolation on a locally finite, transitive and infinit...
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meani...
This is the first of two papers on the critical behaviour of bond percolation models in high dimensi...
We prove a local limit theorem for the probability of a site to be connected by disjoint paths to th...
We study bond percolation evolving in time in such a way that the edges turn on and off independentl...
Abstract. The aim of this paper is to extend the well-known asymptotic shape result for first-passag...
Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond pe...
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson ...
The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolat...
We consider an i.i.d. supercritical bond percolation on Z^d , every edge is open with a probability ...