Related papers: Cluster-size decay in supercritical kernel-based s…
Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…
The explosive percolation problem on the complete graph is investigated via extensive numerical simulations. We obtain the cluster-size distribution at the moment when the cluster size heterogeneity becomes maximum. The distribution is…
For $\Delta \ge 5$ and $q$ large as a function of $\Delta$, we give a detailed picture of the phase transition of the random cluster model on random $\Delta$-regular graphs. In particular, we determine the limiting distribution of the…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…
We study bond percolation of the Cayley tree (CT) by focusing on the probability distribution function (PDF) of a local variable, namely, the size of the cluster including a selected vertex. Because the CT does not have a dominant bulk…
The urban networks of London and New York City are investigated as directed graphs within the paradigm of graph percolation. It has been recently observed that urban networks show a critical percolation transition when a fraction of edges…
In this work we continue the investigation launched in [FHR16] of the structural properties of the structural properties of the Layers model, a dependent percolation model. Given an undirected graph $G=(V,E)$ and an integer $k$, let…
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…
We consider supercritical long-range percolation on transitive graphs of polynomial growth. In this model, any two vertices $x$ and $y$ of the underlying graph $G$ connect by a direct edge with probability $1-\exp(-\beta J(x,y))$, where…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
Preferential attachment networks with power law exponent $\tau>3$ are known to exhibit a phase transition. There is a value $\rho_{\rm c}>0$ such that, for small edge densities $\rho\leq \rho_c$ every component of the graph comprises an…
This paper studies the critical and near-critical regimes of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4]$ using novel coupling techniques. More precisely, we derive the scaling relations between the…
We introduce and study a model of percolation with constant freezing (PCF) where edges open at constant rate 1, and clusters freeze at rate \alpha independently of their size. Our main result is that the infinite volume process can be…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
We formulate and study a model for inhomogeneous long-range percolation on $\Zbold^d$. Each vertex $x\in\Zbold^d$ is assigned a non-negative weight $W_x$, where $(W_x)_{x\in\Zbold^d}$ are i.i.d.\ random variables. Conditionally on the…
We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees have a diverging second moment. Critical percolation on…
We study long-range Bernoulli percolation on $\mathbb{Z}^d$ in which each two vertices $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta \|x-y\|^{-d-\alpha})$. It is a theorem of Noam Berger (CMP, 2002) that if…
We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…
We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…