BibTex format
@article{Wu:2011:10.1080/00207721003605468,
author = {Wu, J and Barahona, M and Tan, Y-J and Deng, H-Z},
doi = {10.1080/00207721003605468},
journal = {International Journal of Systems Science},
pages = {1085--1092--1085--1092},
title = {Robustness of regular ring lattices based on natural connectivity},
url = {http://dx.doi.org/10.1080/00207721003605468},
volume = {42},
year = {2011}
}
RIS format (EndNote, RefMan)
TY - JOUR
AB - 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.
AU - Wu,J
AU - Barahona,M
AU - Tan,Y-J
AU - Deng,H-Z
DO - 10.1080/00207721003605468
EP - 1092
PY - 2011///
SN - 0020-7721
SP - 1085
TI - Robustness of regular ring lattices based on natural connectivity
T2 - International Journal of Systems Science
UR - http://dx.doi.org/10.1080/00207721003605468
UR - http://www.tandfonline.com/doi/abs/10.1080/00207721003605468
UR - http://hdl.handle.net/10044/1/12564
VL - 42
ER -