Percolation on random networks with arbitrary k-core structure
Authors:
Preprint
Abstract
The k-core decomposition of a network has thus far mainly served as a powerful tool for the empirical study of complex networks. We now propose its explicit integration in a theoretical model. We introduce a Hard-core Random Network model that generates maximally random networks with arbitrary degree distribution and arbitrary k-core structure. We then solve exactly the bond percolation problem on the HRN model and produce fast and precise analytical estimates for the corresponding real networks. Extensive comparison with selected databases reveals that our approach performs better than existing models, while requiring less input information.Keywords
All Related Versions
This publication has 39 references indexed in Scilit:
- Global efficiency of local immunization on complex networksScientific Reports, 2013
- Bond percolation on a class of correlated and clustered random graphsJournal of Physics A: Mathematical and Theoretical, 2012
- Identification of influential spreaders in complex networksNature Physics, 2010
- Synchronization in complex networksPhysics Reports, 2008
- Fundamental statistical features and self-similar properties of tagged networksNew Journal of Physics, 2008
- Networks of strong tiesPhysica A: Statistical Mechanics and its Applications, 2007
- Uncovering the overlapping community structure of complex networks in nature and societyNature, 2005
- Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems2002
- Collective dynamics of ‘small-world’ networksNature, 1998
- Network structure and minimum degreeSocial Networks, 1983