Related papers: Given enough choice, simple local rules percolate …
Percolation refers to the emergence of a giant connected cluster in a disordered system when the number of connections between nodes exceeds a critical value. The percolation phase transitions were believed to be continuous until recently…
A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. However, the network percolation with more realistic evolution…
The $k$-core percolation is a fundamental structural transition in complex networks. Through the analysis of the size jump behaviors of $k$-core in the evolution process of networks, we confirm that $k$-core percolation is continuous phase…
The vital nodes are the ones that play an important role in the organization of network structure or the dynamical behaviours of networked systems. Previous studies usually applied the node centralities to quantify the importance of nodes.…
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A \subset V(G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected…
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n,p) in the critical window p=n^{-1}+lambda n^{-4/3}. In particular, we show that this point process has a surprising…
The basic notion of percolation in physics assumes the emergence of a giant connected (percolation) cluster in a large disordered system when the density of connections exceeds some critical value. Until recently, the percolation phase…
In this paper, we prove that Bernoulli percolation on bounded degree graphs with isoperimetric dimension $d>4$ undergoes a non-trivial phase transition (in the sense that $p_c<1$). As a corollary, we obtain that the critical point of…
Perhaps the best understood phase transition is that in the component structure of the uniform random graph process introduced by Erd\H{o}s and R\'enyi around 1960. Since the model is so fundamental, it is very interesting to know which…
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 study four Achlioptas type processes with "explosive" percolation transitions. All transitions are clearly continuous, but their finite size scaling functions are not entire holomorphic. The distributions of the order parameter, the…
Achlioptas processes such as the Bohman--Frieze process are much harder to analyse than the classical Erd\H{o}s--R\'enyi process, due to the dependence between edges added at different stages. This dependence means that most analysis so far…
We provide a sufficient condition on the isoperimetric properties of a regular graph $G$ of growing degree $d$, under which the random subgraph $G_p$ typically undergoes a phase transition around $p=\frac{1}{d}$ which resembles the…
Discontinuous percolation transitions and the associated tricritical points are manifest in a wide range of both equilibrium and non-equilibrium cooperative phenomena. To demonstrate this, we present and relate the continuous and first…
The evolution of the usual Erd\H{o}s-R\'{e}nyi random graph model on n vertices can be described as follows: At time 0 start with the empty graph, with n vertices and no edges. Now at each time k, choose 2 vertices uniformly at random and…
Weak multiplex percolation generalizes percolation to multi-layer networks, represented as networks with a common set of nodes linked by multiple types (colors) of edges. We report a novel discontinuous phase transition in this problem.…
We study the evolution of graphs densifying by adding edges: Two vertices are chosen randomly, and an edge is (i) established if each vertex belongs to a tree; (ii) established with probability $p$ if only one vertex belongs to a tree;…
We investigate bond percolation on mediation-driven attachment (MDA) networks under the generalized Achlioptas process, where $M>1$ candidate bonds are sampled and the one that minimizes the resulting cluster size is selected the…
Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…
We study the edge deletion process of random graphs near a k-core percolation point. We find that the time-dependent number of edges in the process exhibits critically divergent fluctuations. We first show theoretically that the k-core…