English
Related papers

Related papers: Lower bounds for bootstrap percolation on Galton-W…

200 papers

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

Probability · Mathematics 2015-03-13 Gabriel Faraud , Yueyun Hu , Zhan Shi

We are interested in the asymptotic behavior of critical Galton-Watson trees whose offspring distribution may have infinite variance, which are conditioned on having a large fixed number of leaves. We first find an asymptotic estimate for…

Probability · Mathematics 2014-11-14 Igor Kortchemski

We study the critical parameter u^{*} of random interlacements percolation (introduced by A.S Sznitman in arXiv:0704.2560) on a Galton-Watson tree conditioned on the non-extinction event. Starting from the previous work of A. Teixeira in…

Probability · Mathematics 2010-12-06 Martin Tassy

Let $G$ be a vertex-transitive graph of superlinear polynomial growth. Given $r>0$, let $G_r$ be the graph on the same vertex set as $G$, with two vertices joined by an edge if and only if they are at graph distance at most $r$ apart in…

Probability · Mathematics 2025-03-11 Panagiotis Spanos , Matthew Tointon

In standard bootstrap percolation, a subset A of the n x n grid is initially infected. A new site is then infected if at least two of its neighbours are infected, and an infected site stays infected forever. The set A is said to percolate…

Combinatorics · Mathematics 2008-10-14 Robert Morris

We consider the biased random walk on a critical Galton-Watson tree conditioned to survive, and confirm that this model with trapping belongs to the same universality class as certain one-dimensional trapping models with slowly-varying…

Probability · Mathematics 2012-03-20 David A. Croydon , Alexander Fribergh , Takashi Kumagai

We study families of dependent site percolation models on the triangular lattice ${\mathbb T}$ and hexagonal lattice ${\mathbb H}$ that arise by applying certain cellular automata to independent percolation configurations. We analyze the…

Probability · Mathematics 2009-11-10 Federico Camia , Charles M. Newman , Vladas Sidoravicius

We study the distribution of the percolation time $T$ of two-neighbour bootstrap percolation on $[n]^2$ with initial set $A\sim\mathrm{Bin}([n]^2,p)$. We determine $T$ with high probability up to a constant factor for all $p$ above the…

Probability · Mathematics 2015-08-18 Paul Balister , Béla Bollobás , Paul Smith

Let $\mathcal{T}$ be a supercritical Galton-Watson tree with a bounded offspring distribution that has mean $\mu >1$, conditioned to survive. Let $\varphi_{\mathcal{T}}$ be a random embedding of $\mathcal{T}$ into $\mathbb{Z}^d$ according…

Probability · Mathematics 2019-03-14 Remco van der Hofstad , Tim Hulshof , Jan Nagel

We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We…

Probability · Mathematics 2017-12-14 Romain Abraham , Jean-François Delmas

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…

Probability · Mathematics 2012-11-06 Bénédicte Haas , Grégory Miermont

In this paper we address the problem of testing whether two observed trees $(t,t')$ are sampled either independently or from a joint distribution under which they are correlated. This problem, which we refer to as correlation detection in…

Statistics Theory · Mathematics 2024-09-06 Luca Ganassali , Laurent Massoulié , Guilhem Semerjian

Given two graphs $G$ and $H$, it is said that $G$ percolates in $H$-bootstrap process if one could join all the nonadjacent pairs of vertices of $G$ in some order such that a new copy of $H$ is created at each step. Balogh, Bollob\'as and…

Combinatorics · Mathematics 2018-06-28 M. R. Bidgoli , A. Mohammadian , B. Tayfeh-Rezaie

\emph{Full-bond percolation} with parameter $p$ is the process in which, given a graph, for every edge independently, we delete the edge with probability $1-p$. Bond percolation is motivated by problems in mathematical physics and it is…

Probability · Mathematics 2022-05-23 Luca Becchetti , Andrea Clementi , Francesco Pasquale , Luca Trevisan , Isabella Ziccardi

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…

Statistical Mechanics · Physics 2015-09-30 Avik P. Chatterjee , Claudio Grimaldi

Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…

Probability · Mathematics 2007-05-23 Zhenning Kong , Edmund M. Yeh

We consider a null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree in the (sub)-diffusive regime and we prove that properly renormalized, the local time in a critical generation converges in law towards some function of…

Probability · Mathematics 2026-03-26 Alexis Kagan

Recent progress in the study of the contact process [2] has verified that the extinction-survival threshold $\lambda_1$ on a Galton-Watson tree is strictly positive if and only if the offspring distribution $\xi$ has an exponential tail. In…

Probability · Mathematics 2019-10-31 Danny Nam , Oanh Nguyen , Allan Sly

The logarithmic conformal field theory describing critical percolation is further explored using Watts' determination of the probability that there exists a cluster connecting both horizontal and vertical edges. The boundary condition…

High Energy Physics - Theory · Physics 2009-02-02 David Ridout

We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on its outdegree. We give a complete picture of the local convergence of critical or sub-critical marked Galton-Watson…

Probability · Mathematics 2025-09-29 Romain Abraham , Sonia Boulal , Pierre Debs