Some of the results of a spectral analysis of the process of explosive percolation on complex networks (Chung et al., Europhys Lett 101:66003, 2013) are presented here. More specifically, we explore how the maximum eigenvalues of the adjacency matrix of a network, which governs the spreading efficiency, evolves as the density of network connections are increased. We find that for networks with connectivity that grow in an explosive way, information spreading and mass transport are carried out inefficiently. When we looked into the conventional explosive percolation models, the sudden emergency of large connectivity comes with relatively lowered efficiency of spreading. Nevertheless, the spreading efficiency of the explosive models can be improved by introducing heterogeneous structures into the networks.
展开▼
机译：在此处提出了在复杂网络上爆炸性渗透过程的爆炸性分析的一些结果（Chung等，Europhys Lett 101：66003,2013）。更具体地，我们探讨了网络的邻接矩阵的最大特征值，该网络控制效率，随着网络连接的密度而发展的增加。我们发现，对于具有爆炸性方式的连接的网络，信息传播和大规模运输效率低下。当我们研究传统的爆炸性渗透模型时，大连接的突然紧急情况都具有相对较低的蔓延效率。然而，通过将异构结构引入网络来改善爆炸模型的扩展效率。
展开▼
