Exotic phase transitions of k-cores in clustered networks
arXiv:1607.08637 · doi:10.1103/PhysRevE.95.012314
Abstract
The giant -core --- maximal connected subgraph of a network where each node has at least neighbors --- is important in the study of phase transitions and in applications of network theory. Unlike Erdős-Rényi graphs and other random networks where -cores emerge discontinuously for , we show that transitive linking (or triadic closure) leads to 3-cores emerging through single or double phase transitions of both discontinuous and continuous nature. We also develop a -core calculation that includes clustering and provides insights into how high-level connectivity emerges.
arXiv comment5 pages, 5 figures
References in corpus (20)
- Community structure in social and biological networks
- Modularity and community structure in networks
- Catastrophic cascade of failures in interdependent networks
- Random graphs with arbitrary degree distributions and their applications
- Identification of influential spreaders in complex networks
- Resilience of the Internet to random breakdowns
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- New Model of Internet Topology Using k-shell Decomposition
- MEDUSA - New Model of Internet Topology Using k-shell Decomposition
- k-core organization of complex networks
- The Dynamics of Protest Recruitment through an Online Network
- Universal behavior in a generalized model of contagion
- Random graphs with clustering
- Triadic closure as a basic generating mechanism of communities in complex networks
- k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
- Explosive Percolation: Novel critical and supercritical phenomena
- Correlated Edge Overlaps in Multiplex Networks
- Tricritical point in heterogeneous k-core percolation
- A message-passing approach for threshold models of behavior in networks
- General and exact approach to percolation on random graphs