Related papers: Truncated Connectivities in a highly supercritical…
In the $r$-neighbour bootstrap process on a graph $G$, vertices are infected (in each time step) if they have at least $r$ already-infected neighbours. Motivated by its close connections to models from statistical physics, such as the Ising…
We consider the Bernoulli bond percolation model in a box $\Lambda$ (not necessarily parallel to the directions of the lattice) in the regime where the percolation parameter is close to $1$. We condition the configuration on the event that…
Connectedness percolation phenomena in two-dimensional packings of elongated particles (discorectangles) were studied numerically. The packings were produced using random sequential adsorption (RSA) off-lattice model with preferential…
A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independent of the state of edges in B. For an infinite connected…
We explore a bond percolation model on slabs $\mathbb{S}^+_k=\mathbb{Z}_+\times \mathbb{Z}_+\times\{0,\dots,k\}$ featuring one-dimensional inhomogeneities. In this context, a vertical column on the slab comprises the set of vertical edges…
In this article, we study a bond percolation model on a horizontally stretched square lattice, constructed by stretching the distances between the columns of $\mathbb{Z}_+^2$ according to a collection of independent and identically…
We apply connectedness percolation theory to fractal liquids of hard particles, and make use of a Percus-Yevick liquid state theory combined with a geometric connectivity criterion. We find that in fractal dimensions the percolation…
We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…
Consider long-range Bernoulli percolation on $\mathbb{Z}^d$ in which we connect each pair of distinct points $x$ and $y$ by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…
We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
Bootstrap percolation on a graph 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 measure, and we say that spanning…
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 consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…
We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…
We present a study of connectivity percolation in suspensions of hard spherocylinders by means of Monte Carlo simulation and connectedness percolation theory. We focus attention on polydispersity in the length, the diameter and the…
We introduce a percolation model on $\mathbb{Z}^d$, $d \geq 3$, in which the discrete lines of vertices that are parallel to the coordinate axis are entirely removed at random and independently of each other. In this way a vertex belongs to…
Motivated by the importance of geometric information in real systems, a new model for long-range correlated percolation in link-adding networks is proposed with the connecting probability decaying with a power-law of the distance on the…
We prove that the supercritical phase of Voronoi percolation on $\mathbb{R}^d$, $d\geq 3$, is well behaved in the sense that for every $p>p_c(d)$ local uniqueness of macroscopic clusters happens with high probability. As a consequence,…
We study the random connection model on hyperbolic space $\mathbb{H}^d$ in dimension $d=2,3$. Vertices of the spatial random graph are given as a Poisson point process with intensity $\lambda>0$. Upon variation of $\lambda$ there is a…