title: Robustness of random graphs based on graph spectra.
abstract: It has been recently proposed that the robustness of complex networks can be efficiently characterized through the natural connectivity, a spectral property of the graph which corresponds to the average Estrada index. The natural connectivity corresponds to an average eigenvalue calculated from the graph spectrum and can also be interpreted as the Helmholtz free energy of the network. In this article, we explore the use of this index to characterize the robustness of Erdős-Rényi (ER) random graphs, random regular graphs, and regular ring lattices. We show both analytically and numerically that the natural connectivity of ER random graphs increases linearly with the average degree. It is also shown that ER random graphs are more robust than the corresponding random regular graphs with the same number of vertices and edges. However, the relative robustness of ER random graphs and regular ring lattices depends on the average degree and graph size: there is a critical graph size above which regular ring lattices are more robust than random graphs. We use our analytical results to derive this critical graph size as a function of the average degree.
authors.affiliation: College of Information Systems and Management, National University of Defense Technology, Changsha 410073, People's Republic of China. wujunpla@hotmail.com
authors.forename: Jun
authors.initials: J
authors.lastname: Wu
authors.forename: Mauricio
authors.initials: M
authors.lastname: Barahona
authors.forename: Yue-Jin
authors.initials: YJ
authors.lastname: Tan
authors.forename: Hong-Zhong
authors.initials: HZ
authors.lastname: Deng