Related papers: Percolation in two-species antagonistic random seq…
In the usual Achlioptas processes the smallest clusters of a few randomly chosen ones are selected to merge together at each step. The resulting aggregation process leads to the delayed birth of a giant cluster and the so-called explosive…
In conventional site percolation, all lattice sites are occupied with the same probability. For a bipartite lattice, sublattice-selective percolation instead involves two independent occupation probabilities, depending on the sublattice to…
Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel…
We define a continuum percolation model that provides a collection of random ellipses on the plane and study the behavior of the covered set and the vacant set, the one obtained by removing all ellipses. Our model generalizes a construction…
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A \subset V(G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected…
Jamming transition is traditionally regarded as a geometric transition governed by static contact networks. Recently, dynamic phase transitions of athermal particles under periodic shearing provide a new lens on this problem, leading to a…
This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable…
The two-dimensional site percolation problem is studied by transfer-matrix methods on finite-width strips with free boundary conditions. The relationship between correlation-length amplitudes and critical indices, predicted by conformal…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
The study of crossing probabilities - i.e. probabilities of existence of paths crossing rectangles - has been at the heart of the theory of two-dimensional percolation since its beginning. They may be used to prove a number of results on…
We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…
In critical percolation models, in a large cube there will typically be more than one cluster of comparable diameter. In 2D, the probability of $k>>1$ spanning clusters is of the order $e^{-\alpha k^{2}}$. In dimensions d>6, when $\eta = 0$…
We consider high-dimensional percolation at the critical threshold. We condition the origin to be disjointly connected to two points, $x$ and $x'$, and subsequently take the limit as $|x|$, $|x'|$ as well as $|x-x'|$ diverge to infinity.…
In the polluted modified bootstrap percolation model, sites in the square lattice are independently initially occupied with probability $p$ or closed with probability $q$. A site becomes occupied at a subsequent step if it is not closed and…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
We study an interacting box-particle system on a one-dimensional periodic ring involving two species of particles $A$ and $B$. In this model, from a randomly chosen site, a particle of species $A$ can hop to its right neighbor with a rate…
Two-dimensional bootstrap percolation is a cellular automaton in which sites become 'infected' by contact with two or more already infected nearest neighbors. We consider these dynamics, which can be interpreted as a monotone version of the…
The random sequential adsorption (RSA) of identical elongated particles (discorectangles) on a line ("Paris car parking problem") was studied numerically. An off-lattice model with continuous positional and orientational degrees of freedom…
Random sequential adsorption of linear and square particles with excluded volume interaction is studied numerically on planar lattices considering Gaussian distributions of lateral sizes of the incident particles, with several values of the…
We study the nonequilibrium phase transitions from the absorbing phase to the active phase for the model of disease spreading (Susceptible-Infected-Refractory-Susceptible (SIRS)) on a regular one dimensional lattice. In this model,…