Publications

You can also access our individual websites (via the Members page) for further information about our research and lists of our publications.

Citation

BibTex format

@article{Wu:2010,
author = {Wu, J and Barahona, M and Tan, Y and Deng, H},
title = {Robustness of Random Graphs Based on Natural Connectivity},
url = {http://arxiv.org/abs/1009.3430v1},
year = {2010}
}
Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - Recently, it has been proposed that the natural connectivity can be used toefficiently characterise the robustness of complex networks. Naturalconnectivity quantifies the redundancy of alternative routes in a network byevaluating the weighted number of closed walks of all lengths and can beregarded as the average eigenvalue obtained from the graph spectrum. In thisarticle, we explore the natural connectivity of random graphs both analyticallyand numerically and show that it increases linearly with the average degree. Bycomparing with regular ring lattices and random regular graphs, we show thatrandom graphs are more robust than random regular graphs; however, therelationship between random graphs and regular ring lattices depends on theaverage degree and graph size. We derive the critical graph size as a functionof the average degree, which can be predicted by our analytical results. Whenthe graph size is less than the critical value, random graphs are more robustthan regular ring lattices, whereas regular ring lattices are more robust thanrandom graphs when the graph size is greater than the critical value.
AU  - Wu,J
AU  - Barahona,M
AU  - Tan,Y
AU  - Deng,H
PY  - 2010///
TI  - Robustness of Random Graphs Based on Natural Connectivity
UR  - http://arxiv.org/abs/1009.3430v1
UR  - http://hdl.handle.net/10044/1/12566
ER  -
Download

Useful Links