For ordinary (independent) percolation on a large class of lattices it is well known that below the critical percolation parameter pc the cluster size distribution has exponential decay and that power-law behavior of this distri-bution can only occur at pc. This behavior is often called “sharpness of the percolation transition.” For theoretical reasons, as well as motivated by applied research, there is an increasing interest in percolation models with (weak) dependencies. For instance, biologists and agricultural researchers have used (stationary distrib-utions of) certain two-dimensional contact-like processes to model vegetation patterns in an arid landscape (see [20]). In that context occupied clusters are interpreted as patches of vege...
We consider a percolationlike phenomenon on a generalization of the Barabasi-Albert model, where a m...
We consider self-avoiding walk and percolation in d, oriented percolation in d×+, and the contact pr...
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
For ordinary (independent) percolation on a large class of lattices it is well known that below the ...
We study versions of the contact process with three states, and with infections occurring at a rate ...
Percolation theory is a useful tool when modeling the random interconnectivity of the microscopic el...
Percolation theory is a useful tool when modeling the random interconnectivity of the microscopic el...
International audienceWe show that simple, stationary point processes of a given intensity on $\mR^d...
We consider a percolationlike phenomenon on a generalization of the Barabási-Albert model, where a m...
We consider a percolationlike phenomenon on a generalization of the Barabási-Albert model, where a m...
We consider self-avoiding walk and percolation in d, oriented percolation in d×+, and the contact pr...
Percolation theory concerns the emergence of connected clusters that percolate through a networked s...
www.elsevier.com/locate/spa Sharpness versus robustness of the percolation transition in 2d contact ...
48 pages, 6 figuresHeuristics indicate that point processes exhibiting clustering of points have lar...
We consider a percolationlike phenomenon on a generalization of the Barabasi-Albert model, where a m...
We consider a percolationlike phenomenon on a generalization of the Barabasi-Albert model, where a m...
We consider self-avoiding walk and percolation in d, oriented percolation in d×+, and the contact pr...
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
For ordinary (independent) percolation on a large class of lattices it is well known that below the ...
We study versions of the contact process with three states, and with infections occurring at a rate ...
Percolation theory is a useful tool when modeling the random interconnectivity of the microscopic el...
Percolation theory is a useful tool when modeling the random interconnectivity of the microscopic el...
International audienceWe show that simple, stationary point processes of a given intensity on $\mR^d...
We consider a percolationlike phenomenon on a generalization of the Barabási-Albert model, where a m...
We consider a percolationlike phenomenon on a generalization of the Barabási-Albert model, where a m...
We consider self-avoiding walk and percolation in d, oriented percolation in d×+, and the contact pr...
Percolation theory concerns the emergence of connected clusters that percolate through a networked s...
www.elsevier.com/locate/spa Sharpness versus robustness of the percolation transition in 2d contact ...
48 pages, 6 figuresHeuristics indicate that point processes exhibiting clustering of points have lar...
We consider a percolationlike phenomenon on a generalization of the Barabasi-Albert model, where a m...
We consider a percolationlike phenomenon on a generalization of the Barabasi-Albert model, where a m...
We consider self-avoiding walk and percolation in d, oriented percolation in d×+, and the contact pr...
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...