Related papers: On the threshold for triangulations inside convex …
A construction as a growth process for sampling of the uniform infinite planar triangulation (UIPT), defined in a previous paper, is given. The construction is algorithmic in nature, and is an efficient method of sampling a portion of the…
We use invasion percolation to compute numerical values for bond and site percolation thresholds $p_c$ (existence of an infinite cluster) and $p_u$ (uniqueness of the infinite cluster) of tesselations $\{P,Q\}$ of the hyperbolic plane,…
We study site percolation on uniform quadrangulations of the upper half plane. The main contribution is a method for applying Angel's peeling process, in particular for analyzing an evolving boundary condition during the peeling. Our method…
In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…
Invasion percolation is a stochastic growth model that follows a greedy algorithm. After assigning i.i.d. uniform random variables (weights) to all edges of $\mathbb{Z}^d$, the growth starts at the origin. At each step, we adjoin to the…
In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
Fractal percolation has been introduced by Mandelbrot in 1974. We study the two-dimensional case, with integer subdivision index M and survival probability p. It is well known that there exists a non-trivial critical value p_c(M) such that…
We consider Bernoulli first-passage percolation on the triangular lattice in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. For each $p\in(0,p_c)$, let $\mathcal {B}(p)$ be the limit shape in the…
The properties of polymer composites with nanofiller particles change drastically above a critical filler density known as the percolation threshold. Real nanofillers, such as graphene flakes and cellulose nanocrystals, are not idealized…
Given $\omega\ge 1$, let $Z^2_{(\omega)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $\omega$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let…
We summarize several decades of work in finding values for the percolation threshold p_c for site percolation on the square lattice, the universal correction-to-scaling exponent Omega, and the susceptibility amplitude ratio C^+/C^-, in two…
We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then…
We consider a four-vertex model introduced by B\'{a}lint T\'{o}th: a dependent bond percolation model on $\mathbb{Z}^2$ in which every edge is present with probability 1/2 and each vertex has exactly two incident edges, perpendicular to…
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…
Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…
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 supercritical bond percolation on a family of high-girth $d$-regular expanders. Alon, Benjamini and Stacey (2004) established that its critical probability for the appearance of a linear-sized ("giant'') component is…
We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…
Consider triangulations of $\mathbb R P^2$ whose all vertices have valency six except three vertices of valency $4$. In this chapter we prove that the number $f(n)$ of such triangulations with no more than $n$ triangles grows as $C\cdot…