Related papers: Continuous Percolation Phase Transitions of Two-di…
Using the finite-size scaling, we have investigated the percolation phase transitions of evolving random networks under a generalized Achlioptas process (GAP). During this GAP, the edge with minimum product of two connecting cluster sizes…
We study the percolation transition in growing networks under an Achlioptas process (AP). At each time step, a node is added in the network and, with the probability $\delta$, a link is formed between two nodes chosen by an AP. We find that…
It has been recently shown that the percolation transition is discontinuous in Erd\H{o}s-R\'enyi networks and square lattices in two dimensions under the Achlioptas Process (AP). Here, we show that when the structure is highly heterogeneous…
Networks are ubiquitous in diverse real-world systems. Many empirical networks grow as the number of nodes increases with time. Percolation transitions in growing random networks can be of infinite order. However, when the growth of large…
We study a process termed "agglomerative percolation" (AP) in two dimensions. Instead of adding sites or bonds at random, in AP randomly chosen clusters are linked to all their neighbors. As a result the growth process involves a diverging…
We investigate variations of the well-known Achlioptas percolation problem, which uses the method of probing sites when building up a lattice system, or probing links when building a network, ultimately resulting in the delay of the…
It is widely believed that certain simple modifications of the random graph process lead to discontinuous phase transitions. In particular, starting with the empty graph on $n$ vertices, suppose that at each step two pairs of vertices are…
We study the site percolation under Achlioptas process (AP) with a product rule in a $2-dimensional$ (2D) square lattice. From the measurement of the cluster size distribution, $P_s$, we find that $P_s$ has a very robust power-law regime…
Motivated by the importance of geometric information in real systems, a new model for long-range correlated percolation in link-adding networks is proposed with the connecting probability decaying with a power-law of the distance on the…
The growth of two-dimensional lattice bond percolation clusters through a cooperative Achlioptas-type of process, where the choice of which bond to occupy next depends upon the masses of the clusters it connects, is shown to go through an…
Achlioptas processes are a class of dynamically grown random graphs where on each step several edges are chosen at random but only one is added. The sum rule, product rule, and bounded size rules have been extensively studied. Here we…
We extend the Achlioptas model for the delay of criticality in the percolation problem. Instead of having a completely random connectivity pattern, we generalize the idea of the two-site probe in the Achlioptas model for connecting smaller…
After the Achlioptas process (AP), which yields the so-called explosive percolation, was introduced, the number of papers on percolation phenomena has been literally exploding. Most of the existing studies, however, have focused only on the…
We consider the "Touch and Stop" cluster growth percolation (CGP) model on the two dimensional square lattice. A key-parameter in the model is the fraction p of occupied "seed" sites that act as nucleation centers from which a particular…
In Achlioptas processes, starting from an empty graph, in each step two potential edges are chosen uniformly at random, and using some rule one of them is selected and added to the evolving graph. Although the evolution of such `local'…
There is still much to discover about the mechanisms and nature of discontinuous percolation transitions. Much of the past work considers graph evolution algorithms known as Achlioptas processes in which a single edge is added to the graph…
The biased link occupation rule in the Achlioptas process (AP) discourages the large clusters to grow much ahead of others and encourages faster growth of clusters which lag behind. In this paper we propose a model where this tendency is…
Ordinary bond percolation (OP) can be viewed as a process where clusters grow by joining them pairwise, by adding links chosen randomly one by one from a set of predefined `virtual' links. In contrast, in agglomerative percolation (AP)…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
Percolation is one of the most studied processes in statistical physics. A recent paper by Achlioptas et al. [Science 323, 1453 (2009)] has shown that the percolation transition, which is usually continuous, becomes discontinuous…