Explosive percolation in graphs

  title={Explosive percolation in graphs},
  author={Santo Fortunato and Filippo Radicchi},
  journal={Journal of Physics: Conference Series},
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the same probability. However, alternative rules for the occupation of sites/bonds might affect the order of the transition. A recent set of rules proposed by Achlioptas et al. [Science 323, 1453 (2009)], characterized by competitive link addition, was claimed… 

Multiple discontinuous percolation transitions on scale-free networks

Percolation transitions in networks, describing the formation of a macroscopic component, are typically considered to be robust continuous transitions in random percolation. Yet, a class of models

Continuous percolation phase transitions of two-dimensional lattice networks under a generalized Achlioptas process

Abstract The percolation phase transitions of two-dimensional lattice networks under a generalized Achlioptas process (GAP) are investigated. During the GAP, two edges are chosen randomly from the

Continuous percolation phase transitions of random networks under a generalized Achlioptas process.

Finite-size scaling is used to investigate the percolation phase transitions of evolving random networks under a generalized Achlioptas process and it is found that β, ν, and s{2}/s{1} at critical point are unchanged and the phase transitions belong to the same universality class.

Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks.

This work performs a finite-size scaling analysis to four dismantling strategies over Erdös-Rényi networks and finds that the critical exponents associated with the initial attacks are consistent with the ones corresponding to random percolation.

Random adsorption process of linear k-mers on square lattices under the Achlioptas process.

We study the explosive percolation with k-mer random sequential adsorption (RSA) process. We consider both the Achlioptas process (AP) and the inverse Achlioptas process (IAP), in which giant cluster

Identifying vital nodes by Achlioptas process

Compared with the existing node centrality indices, the new method performs overall better in identifying the vital nodes that maintain network connectivity and facilitate network synchronization when considering different network structure characteristics, such as link density, degree distribution, assortativity, and clustering.

Opinion Dynamics on Evolving Complex Networks with Explosive Suppression

This study focuses on how the opinions evolving on the growing networks are affected by the structure of the networks, and establishes both random graph and scale-free networks.

Opinion dynamics on typical complex networks and applications

It is shown that the structure and evolving mechanisms are crucial factors to determine whether there will be a stable consensus and to establish the network efficiency at which the system approaches a consensus.

The Opinion Dynamics on the Evolving Complex Network by Achlioptas Process

This study focuses on how the opinions evolving on the growing networks are affected by the Achlioptas Process, and establishes both random graph and scale-free network.



Explosive percolation: a numerical analysis.

A detailed numerical analysis of Achlioptas processes with product rule on various systems, including lattices, random networks á la Erdös-Rényi, and scale-free networks shows that all relevant percolation variables display power-law scaling, just as in continuous second-order phase transitions.

Hamiltonian approach for explosive percolation.

This work presents a cluster growth process that provides a clear connection between equilibrium statistical mechanics and an explosive percolation model similar to the one recently proposed by D. Achlioptas and discloses a family of models with potential application in growth and fragmentation processes of real network systems.

Explosive percolation transition is actually continuous.

A representative model is considered which shows that the explosive percolation transition is actually a continuous, second order phase transition though with a uniquely small critical exponent of thePercolation cluster size.

Explosive percolation in scale-free networks.

The Achlioptas growth process leads to a phase transition with a nonvanishing percolation threshold already for lambda>lambda(c) approximately 2.2.2, but the transition is continuous when lambda<or=3 but becomes discontinuous when lambda>3.

Explosive Percolation in Random Networks

It is shown that incorporating a limited amount of choice in the classic Erdös-Rényi network formation model causes its percolation transition to become discontinuous.

Local cluster aggregation models of explosive percolation.

Perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations, which show the discontinuous emergence of the giant component.

Explosive growth in biased dynamic percolation on two-dimensional regular lattice networks.

  • R. Ziff
  • Physics
    Physical review letters
  • 2009
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

Percolation transitions in scale-free networks under the Achlioptas process.

A continuous transition is also possible depending on the degree distribution of the scale-free network, which originates from the competition between the AP that discourages the formation of a giant component and the existence of hubs that encourages it.

Scaling behavior of explosive percolation on the square lattice.

  • R. Ziff
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2010
Clusters generated by the product-rule growth model of Achlioptas, D'Souza, and Spencer on a two-dimensional square lattice are shown to obey qualitatively different scaling behavior than standard

Percolation critical exponents in scale-free networks.

It is shown that for networks with 3<lambda<4, known to undergo a transition at a finite threshold of dilution, the critical exponents are different than the expected mean-field values of regular percolation in infinite dimensions.