Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 1 papers published in subject: > since this site started. |
Results per page: |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Robustness of Regular Ring Lattices Based on Natural Connectivity | |||
WU Jun,M Barahona,DENG Hongzhong,TAN Yuejin | |||
Information Science and System Science 02 September 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:It has been recently proposed that the natural connectivity can be used to characterize efficiently 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 paper, 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 generalized Bessel functions and show that the natural connectivity of regular ring lattices is independent of network size and increases with average degree monotonically. We also show that random regular graphs have lower natural connectivity, and are thus less robust, than regular ring lattices. | |||
TO cite this article:WU Jun,M Barahona,DENG Hongzhong, et al. Robustness of Regular Ring Lattices Based on Natural Connectivity[OL].[ 2 September 2010] http://en.paper.edu.cn/en_releasepaper/content/4384203 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated