2013/01/03 by Ning Ning Chung, N. N. Chung, Lock Yue Chew +3
Mathematics · Physics and Astronomy · #Adjacency matrix #Complex Network Analysis Techniques #Eigenvalues and eigenvectors #Explosive material #Matrix (chemical analysis) #Percolation (cognitive psychology) #Process (computing) #Stochastic processes and statistical mechanics #Theoretical and Computational Physics #physics.soc-ph
paper · pdf · doi:10.1209/0295-5075/101/66003
published as EPL 101 (2013) 66003 · 11 pages, 4 figures
arxiv created 2013/01/03 · openalex publication_date 2013/03/01 · arxiv updated 2015/06/12 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
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.