Related papers: Continuum Percolation in the Relative Neighborhood…
We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $\mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one…
We consider loop ensembles on random trees. The loops are induced by a Poisson process of links sampled on the underlying tree interpreted as a metric graph. We allow two types of links, crosses and double bars. The crosses-only case…
We study random digraphs on sequences of expanders with bounded average degree {which converge locally in probability}. We prove that the threshold for the existence of a giant strongly connected component, as well as the asymptotic…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph…
We consider percolation properties of the Boolean model generated by a Gibbs point process and balls with deterministic radius. We show that for a large class of Gibbs point processes there exists a critical activity, such that percolation…
In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoperimetric dimension larger than one. For these graphs we are able to prove that p_c < 1, or in other words, that there exists a percolation…
In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R^d is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic…
Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system…
We investigate the steady state of a two-dimensional random resistor network subjected to two competing biased percolations as a function of the bias strength. The properties of the linear and nonlinear regimes are studied by means of Monte…
The theoretical description of transport in a wide class of novel materials is based upon quantum percolation and related random resistor network (RRN) models. We examine the localization properties of electronic states of diverse…
We consider a generalised oriented site percolation model (GOSP) on $\mathbb Z^d$ with arbitrary neighbourhood. The key additional difficulties as compared to standard oriented percolation (OP) are the lack of symmetry and, in two…
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…
We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…
In $H$-percolation, we start with an Erd\H{o}s--R\'enyi graph ${\mathcal G}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing from ${\mathcal G}_{n,p}$ are eventually added. We…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
We extend Smirnov's proof of the existence and conformal invariance of the scaling limit of critical site-percolation on the triangular lattice to particular sequences of periodic graphs with more arbitrary large-scale structure, obtained…
Percolation problems appear in a large variety of different contexts ranging from the design of composite materials to vaccination strategies on community networks. The key observable for many applications is the percolation threshold.…
Bootstrap percolation is a well-known activation process in a graph, in which a node becomes active when it has at least $r$ active neighbors. Such process, originally studied on regular structures, has been recently investigated also in…
We present the results of study of random sequential adsorption of linear segments (needles) on sites of a square lattice. We show that the percolation threshold is a nonmonotonic function of the length of the adsorbed needle, showing a…