Spectral Measure of Robustness in Complex Networks

Simple item page
dc.creatorWu, Jun
dc.creatorTan, Yue-Jin
dc.creatorDeng, Hong-Zhong
dc.creatorLi, Yong
dc.creatorLiu, Bin
dc.creatorLv, Xin
dc.date2008-02-18
dc.date.accessioned2026-07-07T09:21:40Z
dc.date.available2026-07-07T09:21:40Z
dc.descriptionWe introduce the concept of natural connectivity as a robustness measure of complex networks. The natural connectivity has a clear physical meaning and a simple mathematical formulation. It characterizes the redundancy of alternative paths by quantifying the weighted number of closed walks of all lengths. We show that the natural connectivity can be derived mathematically from the graph spectrum as an average eigenvalue and that it increases strictly monotonically with the addition of edges. We test the natural connectivity and compare it with other robustness measures within a scenario of edge elimination. We demonstrate that the natural connectivity has an acute discrimination which agrees with our intuition.
dc.description4 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0802.2564
dc.identifierhttp://arxiv.org/abs/0802.2564
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155107
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.subjectCombinatorics
dc.titleSpectral Measure of Robustness in Complex Networks
dc.typetext

Files

Collections

arXiv