Percolation on random networks with arbitrary-core structure
- 30 December 2013
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 88 (6) , 062820
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 (HRN) 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 real databases reveals that our approach performs better than existing models, while requiring less input information.Keywords
All Related Versions
This publication has 43 references indexed in Scilit:
- Deciphering the global organization of clustering in real complex networksScientific Reports, 2013
- Percolation and epidemics in random clustered networksPhysical Review E, 2009
- Heterogeneous bond percolation on multitype networks with an application to epidemic dynamicsPhysical Review E, 2009
- Synchronization in complex networksPhysics Reports, 2008
- Fundamental statistical features and self-similar properties of tagged networksNew Journal of Physics, 2008
- Directed network modulesNew Journal of Physics, 2007
- Graph evolutionACM Transactions on Knowledge Discovery From Data, 2007
- Spreading dynamics on heterogeneous populations: Multitype network approachPhysical Review E, 2006
- Clustering in complex networks. II. Percolation propertiesPhysical Review E, 2006
- Uncovering the overlapping community structure of complex networks in nature and societyNature, 2005