Robustness of Regular Graphs Based on Natural Connectivity

Details Robustness of Regular Graphs Based on Natural Connectivity Robustness of Regular Graphs Based on Natural Connectivity

2009-12-11

arxiv.org/abs/0912.2144v1

Physics

Condensed Matter

Statistical Mechanics

18 pages, 5 figures

Scientific paper

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 monotonically. We also show that random regular graphs have lower natural connectivity, and are thus less robust, than regular ring lattices.

Affiliated with

Also associated with

No associations

Rating

Robustness of Regular Graphs Based on Natural Connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robustness of Regular Graphs Based on Natural Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robustness of Regular Graphs Based on Natural Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-467752