Robustness of regular ring lattices based on natural connectivity
File(s)
Accepted version
Author(s)
Wu, J
Barahona, M
Tan, Y-J
Deng, H-Z
Type
Journal Article
Abstract
It has been recently proposed that natural connectivity can be used to efficiently characterise the robustness of complex networks. The natural connectivity quantifies the redundancy of alternative routes in the network by evaluating the weighted number of closed walks of all lengths and can be seen as an average eigenvalue obtained from the graph spectrum. In this article, we explore both analytically and numerically the natural connectivity of regular ring lattices and regular random graphs obtained through degree-preserving random rewirings from regular ring lattices. We reformulate the natural connectivity of regular ring lattices in terms of generalised Bessel functions and show that the natural connectivity of regular ring lattices is independent of network size and increases with K monotonically. We also show that random regular graphs have lower natural connectivity, and are thus less robust, than regular ring lattices.
Date Issued
2011-07-01
Citation
International Journal of Systems Science, 2011, 42, pp.1085-1092-1085-1092
ISSN
0020-7721
Publisher
TAYLOR & FRANCIS LTD
Start Page
1085-1092
End Page
1085-1092
Journal / Book Title
International Journal of Systems Science
Volume
42
Issue
7
Copyright Statement
© 2011 Taylor & Francis. This is an electronic version of an article published in the International Journal of Systems Science, 42 (7), 2011. The INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE is available online at: http://www.tandfonline.com/doi/abs/10.1080/00207721003605468
Description
12.12.13 KB. Ok to add accepted version to spiral, embargo elapsed.
Identifier
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000291857800003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
Article Number
7