Generalized model for k-core percolation and interdependent networks.

@article{Panduranga2017GeneralizedMF,
  title={Generalized model for k-core percolation and interdependent networks.},
  author={Nagendra K. Panduranga and Jianxi Gao and Xin Yuan and Harry Eugene Stanley and Shlomo Havlin},
  journal={Physical review. E},
  year={2017},
  volume={96 3-1},
  pages={
          032317
        }
}
Cascading failures in complex systems have been studied extensively using two different models: k-core percolation and interdependent networks. We combine the two models into a general model, solve it analytically, and validate our theoretical results through extensive simulations. We also study the complete phase diagram of the percolation transition as we tune the average local k-core threshold and the coupling between networks. We find that the phase diagram of the combined processes is very… 

Figures from this paper

Generalized k-core percolation on correlated and uncorrelated multiplex networks.

The existence of a tipping point of the number of layers, above which the Gk-core collapses abruptly is unraveled, and the assortative mixing for interlayer degrees strengthens the GK-core but still gives rise to discontinuous phase transitions as compared to the uncorrelated counterparts.

Generalization of core percolation on complex networks.

A k-leaf removal algorithm as a generalization of the so-called leaf removal algorithm, where vertices of degree smaller than k are progressively removed from a random network and the network is reduced to a subgraph which is called the Generalized k-core (Gk-core).

Random growth lattice filling model of percolation: a crossover from continuous to discontinuous transition

A random growth lattice filling model of percolation with a touch and stop growth rule is developed and studied numerically on a two dimensional square lattice. Nucleation centers are continuously

Graph-Theoretic Approach for Increasing Participation in Networks With Assorted Resources

A generalized model of individuals’ participation in such networks, and a strategy to maximize the number of participating individuals, which incorporates both the network structure and the heterogeneity of individuals in terms of their attributes and resources is presented.

Cascading failures in complex networks

This review summarizes recent progress on models developed based on physics and complex network science to understand the mechanisms, dynamics and overall impact of cascading failures and presents models for cascading failure in single networks and interdependent networks.

A Survey on Frameworks Used for Robustness Analysis on Interdependent Networks

There exists a broad range of interdependent network models, robustness metrics, and studies that can be used to understand the behaviour of different systems under failure or attack, and opportunities in network research are suggested, including the study of robustness on interdependent networks with multiple interactions and/or spatially embedded networks.

Network Robustness Analysis Based on Maximum Flow

Network robustness is the ability of a network to maintain a certain level of structural integrity and its original functions after being attacked, and it is the key to whether the damaged network

References

SHOWING 1-10 OF 14 REFERENCES

The Self Organizing Economy

Rethinking international trade (collected papers) the age of diminished expectations geography and trade currencies and crises target zones and currency bands trade with Japan peddling prosperity

Proceedings of the National Academy of Sciences, USA

New J

  • Phys. 18, 083013
  • 2016

Physical Review E 87

  • 052812
  • 2013

Proteomics 5

  • 444
  • 2005

Physics Reports 544

  • 1
  • 2014

Europhys

  • Lett. 97, 16006
  • 2012

Smart Grid 7

  • 530
  • 2016

Science 325

  • 425
  • 2009

and R

  • M. D’Souza, Phys. Rev. E 82, 056101
  • 2010