Spectral Anlysis on Explosive Percolation
arXiv:1301.0399 · doi:10.1209/0295-5075/101/66003
Abstract
We study the spectral properties of the process of explosive percolation. In particular, we explore how the maximum eigenvalue of the adjacency matrix of a network which governs the spreading efficiency evolves as the density of connection increases. Interestingly, for networks with connectivity that grow in an explosive way, information spreading and mass transport are found to be carried out inefficiently. In the conventional explosive percolation models that we studied, the sudden emergences of large-scale connectivity are found to come with relatively lowered efficiency of spreading. Nevertheless, the spreading efficiency of the explosive model can be increased by introducing heterogeneous structures into the networks.
11 pages, 4 figures
References in corpus (9)
- Self-organized adaptation of a simple neural circuit enables complex robot behaviour
- Impact of Single Links in Competitive Percolation -- How complex networks grow under competition
- Explosive percolation in scale-free networks
- Explosive percolation via control of the largest cluster
- Strongly discontinuous explosive percolation with multiple giant components
- Using explosive percolation in analysis of real-world networks
- Suppression effect on explosive percolations
- Explosive percolations on the Bethe Lattice
- Social Climber attachment in forming networks produces phase transition in a measure of connectivity