Related papers: Multi-source invasion percolation on the complete …
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…
We analyse the cluster discovered by invasion percolation on a branching process with a power-law offspring distribution. Invasion percolation is a paradigm model of self-organised criticality, where criticality is approached without tuning…
For any small constant $\epsilon>0$, the Erd\H{o}s-R\'enyi random graph $G(n,\frac{1+\epsilon}{n})$ with high probability has a unique largest component which contains $(1\pm O(\epsilon))2\epsilon n$ vertices. Let $G_c(n,p)$ be obtained by…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behavior of its $r$-point function for any $r\geq2$ and of its volume both at a given height and below a…
In this paper, we study the order of the largest connected component of a random graph having two sources of randomness: first, the graph is chosen randomly from all graphs with a given degree sequence, and then bond percolation is applied.…
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…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
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…
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…
We study site percolation on a sequence of graphs $\{G_n\}_{n\geq1}$ on $n$ vertices where degree of each vertex is in the interval $(np -a_n, np+a_n)$ and the co-degree of every pair of vertices is at most ${n}p^2+ b_n$, where $p \in…
Frozen percolation on the binary tree was introduced by Aldous around fifteen years ago, inspired by sol-gel transitions. We investigate a version of the model on the triangular lattice, where connected components stop growing ("freeze") as…
The arboreal gas is the probability measure on (unrooted spanning) forests of a graph in which each forest is weighted by a factor $\beta>0$ per edge. It arises as the $q\to 0$ limit of the $q$-state random cluster model with $p=\beta q$.…
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…
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…
We prove rigorously several results about the site-percolation on random recursive trees, observed in the previous work by Kalay and Ben-Naim [J. Phys. A48(2015), no.4, 0405001, 15 pp.]. For a random recursive tree of size $n$, let every…
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…
We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…