The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Spectral Measure of Structural Robustness in Complex Networks
Abstract
We introduce the concept of natural connectivity as a measure of structural robustness in complex networks. The natural connectivity characterizes the redundancy of alternative routes in a network by quantifying the weighted number of closed walks of all lengths. This definition leads to a simple mathematical formulation that links the natural connectivity to the spectrum of a network. The natural connectivity can be regarded as an average eigenvalue that changes strictly monotonically with the addition or deletion of edges. We calculate both analytically and numerically the natural connectivity of three typical networks: regular ring lattices, random graphs, and random scale-free networks. We also compare the proposed natural connectivity to other structural robustness measures within a scenario of edge elimination and demonstrate that the natural connectivity provides sensitive discrimination of structural robustness that agrees with our intuition.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
W., J. W., Abramowitz, M., & Stegun, I. A. (1965) · Mathematics of Computation · doi:10.2307/2004114 · Cited by 18,663
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
Owen, D. B., Abramowitz, M., & Stegun, I. A. (1965) · Technometrics · doi:10.2307/1266136 · Cited by 16,138
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Bollobás, B. (1985) · Cited by 6,196
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Efficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Cited by
A Critical Review of Robustness in Power Grids Using Complex Networks Concepts
Cuadra, L., Salcedo-Sanz, S., Del Ser, J., Jiménez-Fernández, S., & Geem, Z. (2015) · Energies · doi:10.3390/en8099211 · Cited by 277
Metadata
- Authors
- Wu, J., Barahona, M., Tan, Y.-J., & Deng, H.-Z.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Published
- 2011-11
- Volume
- 41
- Issue
- 6
- Pages
- 1244-1252
- ISSN
- 1083-4427 (ISSN-L)
- 1558-2426
- OpenAlex
- W2141884480
- Cited by
- 254
- References
- 37
- FWCI
- 5.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Spectral Measure of Structural Robustness in Complex Networks. https://app.cochat.ai/papers/10.1109/tsmca.2011.2116117
- The paper
- Wu, J., Barahona, M., Tan, Y.-J., & Deng, H.-Z. (2011). Spectral Measure of Structural Robustness in Complex Networks. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans. https://doi.org/10.1109/tsmca.2011.2116117
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.