Related papers: Embedding binary sequences into Bernoulli site per…

We study Voronoi percolation on a large class of $d$-dimensional Riemannian manifolds, which includes the hyperbolic spaces $\mathbb{H}^d$, $d\geq 2$. We prove that as the intensity $\lambda$ of the underlying Poisson point process tends to…

We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…

We study proper lattice animals for bond- and site-percolation on the hypercubic lattice $\mathbb{Z}^d$ to derive asymptotic series of the percolation threshold $p_c$ in $1/d$, The first few terms of these series were computed in the 1970s,…

We prove the almost sure ('quenched') invariance principle for a random walker on an infinite Bernoulli percolation cluster in $\Z^d$ where $d$ is larger or equal than 2.

A circle packing is a collection of disks with disjoint interiors in the plane. It naturally defines a graph by tangency. It is shown that there exists $p>0$ such that the following holds for every circle packing: If each disk is retained…

We present Monte Carlo estimates for site and bond percolation thresholds in simple hypercubic lattices with 4 to 13 dimensions. For d<6 they are preliminary, for d >= 6 they are between 20 to 10^4 times more precise than the best previous…

This is a study of percolation in the hyperbolic plane and on regular tilings in the hyperbolic plane. The processes discussed include Bernoulli site and bond percolation on planar hyperbolic graphs, invariant dependent percolations on such…

We consider inhomogeneous non-oriented Bernoulli bond percolation on $\mathbb{Z}^d$, where each edge has a parameter depending on its direction. We prove that, under certain conditions, if the sum of the parameters is strictly greater than…

We consider long-range Bernoulli bond percolation on the $d$-dimensional hierarchical lattice in which each pair of points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $0<\alpha<d$ is…

We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…

Let $d\ge 3$ be a fixed integer, $p\in (0,1)$, and let $n\geq 1$ be a positive integer such that $dn$ is even. Let $\mathbb{G}(n, d, p)$ be a (random) graph on $n$ vertices obtained by drawing uniformly at random a $d$-regular (simple)…

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…

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

We consider Bernoulli percolation on $\mathbb Z^d$ with $d>6$. We prove an up-to-constant estimate for the critical two-point function restricted to a half-space. This completes previous results of Chatterjee and Hanson (Commun. Pure Appl.…

In the first paper of this series [S. Torquato, J. Chem. Phys. {\bf 136}, 054106 (2012)], analytical results concerning the continuum percolation of overlapping hyperparticles in $d$-dimensional Euclidean space $\mathbb{R}^d$ were obtained,…

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…

Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number.…

Eulerian percolation on Z 2 with parameter p is the classical Bernoulli bond percolation with parameter p conditioned on the fact that every site has an even degree. We first explain why Eulerian percolation with parameter p coincides with…

We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times \{1, \cdots, k\},$ namely the slab $\mathbb{S}_k$ of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $p_c(\mathbb{S}_k)$)…