Related papers: Newman-Ziff algorithm for the bootstrap percolatio…
We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…
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…
We consider the effects of spatial correlations in a two-dimensional site percolation model. By generalizing the Newman-Ziff Monte Carlo algorithm to include spatial correlations, percolation thresholds and fractal dimensions of percolation…
We study bootstrap percolation (BP) on hyperbolic lattices obtained by regular tilings of the hyperbolic plane. Our work is motivated by the connection between the BP transition and the dynamical transition of kinetically constrained…
New calculations to over ten million time steps have revealed a more complex diffusive behavior than previously reported, of a point particle on a square and triangular lattice randomly occupied by mirror or rotator scatterers. For the…
We consider isoperimetric sets, i.e., sets with minimal vertex boundary for a prescribed volume, of the infinite cluster of supercritical site percolation on the triangular lattice. Let $p$ be the percolation parameter and let $p_c$ be the…
Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…
We propose a powerful method based on the Hoshen-Kopelman algorithm for simulating percolation asynchronously on distributed machines. Our method demands very little of hardware and yet we are able to make high precision measurements on…
We study families of dependent site percolation models on the triangular lattice ${\mathbb T}$ and hexagonal lattice ${\mathbb H}$ that arise by applying certain cellular automata to independent percolation configurations. We analyze the…
Extended-range percolation on various regular lattices, including all eleven Archimedean lattices in two dimensions, and the simple cubic (SC), body-centered cubic (BCC), and face-centered cubic (FCC) lattices in three dimensions, is…
By bootstrap percolation we mean the following deterministic process on a graph $G$. Given a set $A$ of vertices "infected" at time 0, new vertices are subsequently infected, at each time step, if they have at least $r\in\mathbb{N}$…
We obtain new lower bounds on the critical points for various models of oriented percolation. The method is to provide a stochastic domination of the percolation processes by multitype Galton-Watson trees. This can be apply to the classical…
This work analyzes a percolation model on the diamond hierarchical lattice (DHL), where the percolation transition is retarded by the inclusion of a probability of erasing specific connected structures. It has been inspired by the recent…
Descriptors that characterize the geometry and topology of the pore space of porous media are intimately linked to their transport properties. We quantify such descriptors, including pore-size functions and the critical pore radius…
Jamming and percolation transitions in the standard random sequential adsorption of particles on regular lattices are characterized by a universal set of critical exponents. The universality class is preserved even in the presence of…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product…
We consider bootstrap percolation on uncorrelated complex networks. We obtain the phase diagram for this process with respect to two parameters: $f$, the fraction of vertices initially activated, and $p$, the fraction of undamaged vertices…
We introduce the \emph{leaf-excluded} percolation model, which corresponds to independent bond percolation conditioned on the absence of leaves (vertices of degree one). We study the leaf-excluded model on the square and simple-cubic…
The present work introduces an efficient Monte Carlo algorithm for continuum percolation composed of randomly-oriented rectangles. By conducting extensive simulations, we report high precision percolation thresholds for a variety of…