Häggström, Peres, and Steif (1997) have introduced a dynamical version of percolation on a graph $G$. When $G$ is a tree they derived a necessary and sufficient condition for percolation to exist at some time $t$. In the case that $G$ is a spherically symmetric tree, Häggström, Peres, and Steif (1997) derived a necessary and sufficient condition for percolation to exist at some time $t$ in a given target set $D$. The main result of the present paper is a necessary and sufficient condition for the existence of percolation, at some time $t\in D$, in the case that the underlying tree is not necessary spherically symmetric. This answers a question of Yuval Peres (personal communication). We present also a formula for the Hausdorff dimension of the set of exceptional times of percolation.
For horocyclic products of percolation subtrees of regular trees, we show almost sure amenability. Under a symmetry condition concerning the growth of the two percolation trees, we show the existence of an increasing Foelner sequence (which we call strong amenability).
We consider Bernoulli (bond) percolation with parameter $p$ on the Cayley tree of order $k$. We introduce the notion of zebra-percolation that is percolation by paths of alternating open and closed edges. In contrast with standard percolation with critical threshold at $p_c= 1/k$, we show that zebra-percolation occurs between two critical values $p_{{\rm c},1}$ and $p_{{\rm c},2}$ (explicitly given). We provide the specific formula of zebra-percolation function.
This paper surveys the results of recent collaborations with Eric Derbez and with Takashi Hara, which show that intergrated super-Brownian excursion (ISE) arises as the scaling limit of both lattice trees and the incipient infinite percolation cluster, in high dimensions. A potential extension to oriented percolation is also mentioned.
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 convergence in distribution of this tree to the genealogical tree of a continuous-state branching process in discrete time. As a corollary we obtain the asymptotic sizes of the largest and next largest percolation clusters, extending thereby a recent work of Bertoin (2014) which deals with cluster sizes in the supercritical regime. In a second part, we show that the…
This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a general criterion for the existence of giant percolation clusters in large trees, which answers a question raised by David Croydon.
In this paper, we consider random trees associated with the genealogy of Crump-Mode-Jagers processes and perform Bernoulli bond-percolation whose parameter depends on the size of the tree. Our purpose is to show the existence of a giant percolation cluster for appropriate regimes as the size grows. We stress that the family trees of Crump-Mode-Jagers processes include random recursive trees, preferential attachment trees, binary search trees for which this question has been answered by Bertoin, as well as (more general) m-ary search trees, fragmentation trees, median-of-(2l+1) binary search tr…
In the context of percolation in a regular tree, we study the size of the largest cluster and the length of the longest run starting within the first d generations. As d tends to infinity, we prove almost sure and weak convergence results.
We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of trees. A sufficient condition is established for Galton-Watson trees.
We consider Bernoulli bond percolation on the product graph of a regular tree and a line. We show that the triangle condition does not hold at the uniqueness threshold.
We analyze the metastable states near criticality of the bootstrap percolation on Galton-Watson trees. We find that, depending on the exact choice of the offspring distribution, it is possible to have several distinct metastable states, with varying scaling of their duration while approaching criticality.
We consider the model of random trees introduced by Devroye (1999), the so-called random split trees. The model encompasses many important randomized algorithms and data structures. We then perform supercritical Bernoulli bond-percolation on those trees and obtain a precise weak limit theorem for the sizes of the largest clusters. We also show that the approach developed in this work may be useful for studying percolation on other classes of trees with logarithmic height, for instance, we study also the case of $d$-regular trees.
A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees, fringe-balanced trees, digital search trees and random simplex trees. In this work, we study Bernoulli bond percolation on arbitrary split trees of large but finite cardinality $n$. We show for appropriate percolation regimes that depend on the cardinality $n$ of the split tree that there exists a unique giant cluster, the fluctuations of the size of the giant clust…
We consider a Bernoulli bond percolation on a random recursive tree of size $n\gg 1$, with supercritical parameter $p_n=1-c/\ln n$ for some $c>0$ fixed. It is known that with high probability, there exists then a unique giant cluster of size $G_n\sim \e^{-c}$, and it follows from a recent result of Schweinsberg \cite{Sch} that $G_n$ has non-gaussian fluctuations. We provide an explanation of this by analyzing the effect of percolation on different phases of the growth of recursive trees. This alternative approach may be useful for studying percolation on other classes of trees, such as for ins…
We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation induces a probability measure on infinite paths from the root. We show that under certain conditions of the progeny distribution, this measure is absolutely continuous with respect to the limit uniform measure. This confirms that invasion percolation, an efficient self-tuning algorithm, may be used to sample approximately from the limit uniform distribution. Addi…
We consider critical percolation on Galton-Watson trees and prove quenched analogues of classical theorems of critical branching processes. We show that the probability critical percolation reaches depth $n$ is asymptotic to a tree-dependent constant times $n^{-1}$. Similarly, conditioned on critical percolation reaching depth $n$, the number of vertices at depth $n$ in the critical percolation cluster almost surely converges in distribution to an exponential random variable with mean depending only on the offspring distribution. The incipient infinite cluster (IIC) is constructed for a.e. Gal…
For the Gaussian free field on a $(d + 1)$-regular tree with $d \geq 2$, we study the percolative properties of its level sets in the critical and the near-critical regime. In particular, we show the continuity of the percolation probability, derive an exact symptotic tail estimate for the cardinality of the connected component of the critical level set, and describe the asymptotic behaviour of the percolation probability in the near-critical regime.
In invasion percolation, the edges of successively maximal weight (the outlets) divide the invasion cluster into a chain of ponds separated by outlets. On the regular tree, the ponds are shown to grow exponentially, with law of large numbers, central limit theorem and large deviation results. The tail asymptotics for a fixed pond are also studied and are shown to be related to the asymptotics of a critical percolation cluster, with a logarithmic correction.
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches per vertex. This generalizes and unifies previous work of the authors. It also shows that the point of phase transition for edge-reinforced random walk is likewise determined by the branching number of the tree. Finally, we show that the branching number determines the rate of first-passage percolation on trees, also known as the first-birth problem. Our tech…
We study a percolation process on the planted binary tree, where clusters freeze as soon as they become larger than some fixed parameter N. We show that as N goes to infinity, the process converges in some sense to the frozen percolation process introduced by Aldous. In particular, our results show that the asymptotic behaviour differs substantially from that on the square lattice, on which a similar process has been studied recently by van den Berg, de Lima and Nolin.
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 clusters, extending a recent result for large random recursive trees. The approach relies on the analysis of the asymptotic behavior of branching processes subject to rare neutral mutations, which may be of independent interest.
We show that critical percolation on a product of two regular trees of degree $\ge$ 3 satisfies the triangle condition. The proof does not examine the degrees of vertices and is not "perturbative" in any sense. It relies on an unpublished lemma of Oded Schramm.
In frozen percolation, i.i.d. uniformly distributed activation times are assigned to the edges of a graph. At its assigned time, an edge opens provided neither of its endvertices is part of an infinite open cluster; in the opposite case, it freezes. Aldous (2000) showed that such a process can be constructed on the infinite 3-regular tree and asked whether the event that a given edge freezes is a measurable function of the activation times assigned to all edges. We give a negative answer to this question, or, using an equivalent formulation and terminology introduced by Aldous and Bandyopadhya…
We explore the survival function for percolation on Galton-Watson trees. Letting $g(T,p)$ represent the probability a tree $T$ survives Bernoulli percolation with parameter $p$, we establish several results about the behavior of the random function $g(\mathbf{T} , \cdot)$, where $\mathbf{T}$ is drawn from the Galton-Watson distribution. These include almost sure smoothness in the supercritical region; an expression for the $k\text{th}$-order Taylor expansion of $g(\mathbf{T} , \cdot)$ at criticality in terms of limits of martingales defined from $\mathbf{T}$ (this requires a moment condition d…
We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour, which started from the root of a tree, spreads out through an infinite number of its vertices. We present lower and upper bounds for the probability of that event, according to the distribution of the random variables that defines the radius of influence of each individual. We work with Galton-Watson branching trees (homogeneous and non-homogeneous) and spherically symmetric trees which includes homogeneous and $k-$periodic trees.
We consider Bernoulli bond percolation on oriented regular trees, where besides the usual short bonds, all bonds of a certain length are added. Independently, short bonds are open with probability $p$ and long bonds are open with probability $q$. We study properties of the critical curve which delimits the set of pairs $(p,q)$ for which there are almost surely no infinite paths. We also show that this curve decreases with respect to the length of the long bonds.
Consider independent bond percolation with retention probability p on a spherically symmetric tree Gamma. Write theta_Gamma(p) for the probability that the root is in an infinite open cluster, and define the critical value p_c=inf{p:theta_Gamma(p)>0}. If theta_Gamma(p_c)=0, then the root may still percolate in the corresponding dynamical percolation process at the critical value p_c, as demonstrated recently by Haggstrom, Peres and Steif. Here we relate this phenomenon to the near-critical behaviour of theta_Gamma(p) by showing that the root percolates in the dynamical percolation process if a…
We consider the following, intuitively described process: at time zero, all sites of a binary tree are at rest. Each site becomes activated at a random uniform [0,1] time, independent of the other sites. As soon as a site is in an infinite cluster of activated sites, this cluster of activated sites freezes. The main question is whether a process like this exists. Aldous [Ald00] proved that this is the case for a slightly different version of frozen percolation. In this paper we construct a process that fits the intuitive description and discuss some properties.
We consider supercritical Bernoulli bond percolation on a large $b$-ary tree, in the sense that with high probability, there exists a giant cluster. We show that the size of the giant cluster has non-gaussian fluctuations, which extends a result due to Schweinsberg in the case of random recursive trees. Using ideas in the recent work of Bertoin and Uribe Bravo, the approach developed in this work relies on the analysis of the sub-population with ancestral type in a system of branching processes with rare mutations, which may be of independent interest. This also allows us to establish the anal…
We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of an infinite path of nearest neighbors $v_1,v_2,v_3\ldots$ such that $X_{v_1}<X_{v_2}<X_{v_3}<\cdots$ and which spans the entire graph. The event defined by the existence of such path is called {\it{percolation}}. We consider the case of the accessibility percolation model on a spherically symmetric tree with growth function given by $f(i)=\lceil (i+1)^ α\rcei…
In this paper we consider the geodesic tree in exponential last passage percolation. We show that for a large class of initial conditions around the origin, the line-to-point geodesic that terminates in a cylinder of width $o(N^{2/3})$ and length $o(N)$ agrees in the cylinder, with the stationary geodesic sharing the same end point. In the case of the point-to-point model, we consider width $δN^{2/3}$ and length up to $δ^{3/2} N/(\log(δ^{-1}))^3$ and provide lower and upper bound for the probability that the geodesics agree in that cylinder.
In this paper we study a variation of the accessibility percolation model, this is also motivated by evolutionary biology and evolutionary computation. Consider a tree whose vertices are labeled with random numbers. We study the probability of having a monotone subsequence of a path from the root to a leaf, where any $k$ consecutive vertices in the path contain at least one vertex of the subsequence. An $n$-ary tree, with height $h$, is a tree whose vertices at distance at most $h-1$ to the root have $n$ children. For the case of $n$-ary trees, we prove that, as $h$ tends to infinity the proba…
We prove existence of the scaling limit of the invasion percolation cluster (IPC) on a regular tree. The limit is a random real tree with a single end. The contour and height functions of the limit are described as certain diffusive stochastic processes. This convergence allows us to recover and make precise certain asymptotic results for the IPC. In particular, we relate the limit of the rescaled level sets of the IPC to the local time of the scaled height function.
We consider an inhomogeneous oriented percolation model introduced by de Lima, Rolla and Valesin. In this model, the underlying graph is an oriented rooted tree in which each vertex points to each of its $d$ children with `short' edges, and in addition, each vertex points to each of its $d^k$ descendant at a fixed distance $k$ with `long' edges. A bond percolation process is then considered on this graph, with the prescription that independently, short edges are open with probability $p$ and long edges are open with probability $q$. We study the behavior of the critical curve $q_c(p)$: we find…
We study level-set percolation of the Gaussian free field on the infinite $d$-regular tree for fixed $d\geq 3$. Denoting by $h_\star$ the critical value, we obtain the following results: for $h>h_\star$ we derive estimates on conditional exponential moments of the size of a fixed connected component of the level set above level $h$; for $h<h_\star$ we prove that the number of vertices connected over distance $k$ above level $h$ to a fixed vertex grows exponentially in $k$ with positive probability. Furthermore, we show that the percolation probability is a continuous function of the level $h$,…
Percolation is one of the simplest and nicest models in probability theory/statistical mechanics which exhibits critical phenomena. Dynamical percolation is a model where a simple time dynamics is added to the (ordinary) percolation model. This dynamical model exhibits very interesting behavior. Our goal in thissurvey is to give an overview of the work in dynamical percolation that has been done (and some of which is in the process of being written up).
This note is motivated by results in arXiv:math/0608132 and arXiv:0806.2425 about global relations between the invasion percolation cluster (IPC) and the incipient infinite cluster (IIC) on regular trees and on two dimensional lattices, respectively. Namely, that the laws of the two objects are mutually singular, and, in the case of regular trees, that the IIC stochastically dominates the IPC. We prove that on two dimensional lattices, the IIC does not stochastically dominate the IPC. This is the first example showing that the relation between the IIC and IPC is significantly different on tree…
We consider random walk on dynamical percolation on the discrete torus $\mathbb{Z}_n^d$. In previous work, mixing times of this process for $p<p_c(\mathbb{Z}^d)$ were obtained in the annealed setting where one averages over the dynamical percolation environment. Here we study exit times in the quenched setting, where we condition on a typical dynamical percolation environment. We obtain an upper bound for all $p$ which for $p<p_c$ matches the known lower bound.
Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for $r$-neighbour bootstrap percolation on Galton--Watson trees in terms of moments of the offspring distributions. With this result we confirm a conjecture of Bollobás, Gunderson, Holmgren, Janson and Przykucki. We also show that these bounds are best possible up to positive constants not depending on the offspring distribution.
We consider invasion percolation on the randomly-weighted complete graph $K_n$, started from some number $k(n)$ of distinct source vertices. The outcome of the process is a forest consisting of $k(n)$ trees, each containing exactly one source. Let $M_n$ be the size of the largest tree in this forest. Logan, Molloy and Pralat (arXiv:1806.10975) proved that if $k(n)/n^{1/3} \to 0$ then $M_n/n \to 1$ in probability. In this paper we prove a complementary result: if $k(n)/n^{1/3} \to \infty$ then $M_n/n \to 0$ in probability. This establishes the existence of a phase transition in the structure of…
Consider the class of k-independent bond, respectively site, percolations with parameter p on an infinite tree T. We derive tight bounds on p for both a.s. percolation and a.s. nonpercolation. The bounds are continuous functions of k and the branching number of T. This extends previous results by Lyons for the independent case (k=0) and by Bollobàs & Balister for 1-independent bond percolations. Central to our argumentation are moment method bounds à la Lyons supplemented by explicit percolation models à la Bollobàs & Balister. An indispensable tool is the minimality and explicit construction …
We study invariant percolation processes on the d-regular tree that are obtained as a factor of an iid process. We show that the density of any factor of iid site percolation process with finite clusters is asymptotically at most (log d)/d as d tends to infinity. This bound is asymptotically optimal as it can be realized by independent sets. One implication of the result is a (1/2)-factor approximation gap, asymptotically in d, for estimating the density of maximal induced forests in locally tree-like d-regular graphs via factor of iid processes.
This paper studies a class of growing systems of random walks on regular trees, known as \emph{frog models with geometric lifetime} in the literature. With the help of results from renewal theory, we derive new bounds for their critical parameters. Our approach also improve the bounds of the literature for the critical parameter of a percolation model on trees called \emph{cone percolation}
The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions $d$ up to $d=5$. A robust analysis technique is developed for correlated data, as seen in such trees. This should be a robust method suitable for analyzing a wide array of randomly generated fractal structures. The trees analyzed using these techniques are built using a combination of Prim's and Kruskal's algorithms for finding minimal spanning trees. This combination reduces memory usage and allows for simulation of larger systems than would otherwise be possible. The path length fractal dimens…
We consider first passage percolation (FPP) on T_d x Z, where T_d is the d-regular tree (d>=3). It is shown that for a fixed vertex v in the tree, the fluctuation of the distance in the FPP metric between the points (v,0) and (v,n) is of the order of at most log n. We conjecture that the real fluctuations are of order 1 and explain why.
