Physics – Condensed Matter – Statistical Mechanics
Scientific paper
2010-09-17
Physics
Condensed Matter
Statistical Mechanics
12 pages, 4 figures
Scientific paper
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the weighted number of closed walks of all lengths and can be regarded as the average eigenvalue obtained from the graph spectrum. In this article, we explore the natural connectivity of random graphs both analytically and numerically and show that it increases linearly with the average degree. By comparing with regular ring lattices and random regular graphs, we show that random graphs are more robust than random regular graphs; however, the relationship between random graphs and regular ring lattices depends on the average degree and graph size. We derive the critical graph size as a function of the average degree, which can be predicted by our analytical results. When the graph size is less than the critical value, random graphs are more robust than regular ring lattices, whereas regular ring lattices are more robust than random graphs when the graph size is greater than the critical value.
Barahona Mauricio
Deng Hongzhong
Tan Yuejin
Wu Jun
No associations
LandOfFree
Robustness of Random 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 Random 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 Random Graphs Based on Natural Connectivity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-442288