English
Related papers

Related papers: Percolation on random recursive trees

200 papers

We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…

Combinatorics · Mathematics 2007-05-23 Nikolaos Fountoulakis

We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…

Physics and Society · Physics 2018-12-26 Shogo Mizutaka , Takehisa Hasegawa

Consider percolation on $T\times \mathbb{Z}^d$, the product of a regular tree of degree $k\geq 3$ with the hypercubic lattice $\mathbb{Z}^d$. It is known that this graph has $0<p_c<p_u<1$, so that there are non-trivial regimes in which…

Probability · Mathematics 2024-12-23 Tom Hutchcroft , Minghao Pan

We prove that the rescaled one-point fluctuations of the boundary of the percolation cluster in the Bernoulli-Exponential first passage percolation around the diagonal converge to a new family of distributions. The limit law is indexed by…

Probability · Mathematics 2024-09-06 Bálint Vető

We generalize the standard site percolation model on the $d$-dimensional lattice to a model on random tessellations of $\mathbb R^d$. We prove the uniqueness of the infinite cluster by adapting the Burton-Keane argument…

Probability · Mathematics 2016-09-16 Sebastian Ziesche

We study bond percolation on the hypercube $\{0,1\}^m$ in the slightly subcritical regime where $p = p_c (1-\varepsilon_m)$ and $\varepsilon_m = o(1)$ but $\varepsilon_m \gg 2^{-m/3}$ and study the clusters of largest volume and diameter.…

Probability · Mathematics 2016-12-07 Tim Hulshof , Asaf Nachmias

We consider directed percolation with an absorbing boundary in 1+1 and 2+1 dimensions. The distribution of cluster lifetimes and sizes depend on the boundary. The new scaling exponents can be related to the exponents characterizing standard…

Statistical Mechanics · Physics 2015-06-25 K. B. Lauritsen , K. Sneppen , M. Markosova , M. H. Jensen

We calculate the distribution of the size of the percolating cluster on a tree in the subcritical, critical and supercritical phase. We do this by exploiting a mapping between continuum trees and Brownian excursions, and arrive at a…

Statistical Mechanics · Physics 2016-10-05 Francesc Font-Clos , Nicholas R. Moloney

We study the growth and isoperimetry of infinite clusters in slightly supercritical Bernoulli bond percolation on transitive nonamenable graphs under the $L^2$ boundedness condition ($p_c<p_{2\to 2}$). Surprisingly, we find that the volume…

Probability · Mathematics 2022-07-08 Tom Hutchcroft

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$,…

Combinatorics · Mathematics 2024-09-10 Sahar Diskin , Michael Krivelevich

We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…

Statistical Mechanics · Physics 2015-12-16 Antoine Allard , Laurent Hébert-Dufresne , Jean-Gabriel Young , Louis J. Dubé

Suspensions of hard core spherical particles of diameter $D$ with inter-core connectivity range $\delta$ can be described in terms of random geometric graphs, where nodes represent the sphere centers and edges are assigned to any two…

Disordered Systems and Neural Networks · Physics 2017-09-12 Claudio Grimaldi

We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…

Disordered Systems and Neural Networks · Physics 2020-07-08 S. S. Manna , Robert M. Ziff

This paper focuses on the asymptotic behaviors of the length of the largest 1-cluster in a finite iid Bernoulli sequence. We first reveal a critical phenomenon on the length and then study its limit distribution.

Probability · Mathematics 2010-11-30 Yong-Hua Mao , Feng Wang , Xian-Yuan Wu

We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…

Probability · Mathematics 2020-11-24 Achillefs Tzioufas

In this work we consider random two-colourings of random linear preferential attachment trees, which includes random recursive trees, random plane-oriented recursive trees, random binary search trees, and a class of random $d$-ary trees.…

Probability · Mathematics 2023-06-13 Colin Desmarais , Cecilia Holmgren , Stephan Wagner

Let $G$ be the product of finitely many trees $T_1\times T_2 \times \cdots \times T_N$, each of which is regular with degree at least three. We consider Bernoulli bond percolation and the Ising model on this graph, giving a short proof that…

Probability · Mathematics 2019-01-11 Tom Hutchcroft

We study the percolation properties of the growing clusters model. In this model, a number of seeds placed on random locations on a lattice are allowed to grow with a constant velocity to form clusters. When two or more clusters eventually…

Statistical Mechanics · Physics 2015-05-18 Nikolaos Tsakiris , Michail Maragakis , Kosmas Kosmidis , Panos Argyrakis

For the supercritical Bernoulli bond percolation on $\mathbb{Z}^d$ ($d \geq 2$), we give a coupling between the random walk on the infinite cluster and its limit Brownian motion, such that the maximum distance between the paths during…

Probability · Mathematics 2025-08-05 Chenlin Gu , Zhonggen Su , Ruizhe Xu

Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…

Statistical Mechanics · Physics 2013-04-04 Stefan Nowak , Joachim Krug