The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Extracting the multiscale backbone of complex weighted networks
Open accessAbstract
A large number of complex systems find a natural abstraction in the form of weighted networks whose nodes represent the elements of the system and the weighted edges identify the presence of an interaction and its relative strength. In recent years, the study of an increasing number of large-scale networks has highlighted the statistical heterogeneity of their interaction pattern, with degree and weight distributions that vary over many orders of magnitude. These features, along with the large number of elements and links, make the extraction of the truly relevant connections forming the network's backbone a very challenging problem. More specifically, coarse-graining approaches and filtering techniques come into conflict with the multiscale nature of large-scale systems. Here, we define a filtering method that offers a practical procedure to extract the relevant connection backbone in complex multiscale networks, preserving the edges that represent statistically significant deviations with respect to a null model for the local assignment of weights to edges. An important aspect of the method is that it does not belittle small-scale interactions and operates at all scales defined by the weight distribution. We apply our method to real-world network instances and compare the obtained results with alternative backbone extraction techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
SIMPSON, E. H. (1949) · Nature · doi:10.1038/163688a0 · Cited by 14,164
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Self-citationBarabási, A.-L., & Bonabeau, E. (2003) · Scientific American · doi:10.1038/scientificamerican0503-60 · Cited by 2,494
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
Network structure and biodiversity loss in food webs: robustness increases with connectance
Dunne, J. A., Williams, R. J., & Martinez, N. D. (2002) · Ecology Letters · doi:10.1046/j.1461-0248.2002.00354.x · Cited by 1,812
How popular is your paper? An empirical study of the citation distribution
Redner, S. (1998) · The European Physical Journal B · doi:10.1007/s100510050359 · Cited by 1,509
Self-similarity of complex networks
Song, C., Havlin, S., & Makse, H. A. (2005) · Nature · doi:10.1038/nature03248 · Cited by 1,495
Scale-Free Brain Functional Networks
Eguíluz, V. M., Chialvo, D. R., Cecchi, G. A., Baliki, M., & Apkarian, A. V. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.018102 · Cited by 1,460
Hirschman, A. (1964) · American Economic Review · Cited by 951
Email networks and the spread of computer viruses
Newman, M. E. J., Forrest, S., & Balthrop, J. (2002) · Physical Review E · doi:10.1103/physreve.66.035101 · Cited by 798
Scale-Free Networks: Complex Webs in Nature and Technology
Caldarelli, G. (2007) · doi:10.1093/acprof:oso/9780199211517.001.0001 · Cited by 748
Global organization of metabolic fluxes in the bacterium Escherichia coli
Almaas, E., Kovács, B., Vicsek, T., Oltvai, Z. N., & Barabási, A.-L. (2004) · Nature · doi:10.1038/nature02289 · Cited by 709
Bootstrap percolation on a Bethe lattice
Chalupa, J., Leath, P. L., & Reich, G. R. (1979) · Journal of Physics C: Solid State Physics · doi:10.1088/0022-3719/12/1/008 · Cited by 572
Transport in Weighted Networks: Partition into Superhighways and Roads
Wu, Z., Braunstein, L. A., Havlin, S., & Stanley, H. E. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.148702 · Cited by 161
Derrida, B., & Flyvbjerg, H. (1987) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/20/15/039 · Cited by 160
Coarse-graining and self-dissimilarity of complex networks
Itzkovitz, S., Levitt, R., Kashtan, N., Milo, R., Itzkovitz, M., & Alon, U. S. (2005) · Physical Review E · doi:10.1103/physreve.71.016127 · Cited by 149
Spectral Coarse Graining of Complex Networks
Gfeller, D., & Rios, P. D. L. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.038701 · Cited by 144
Minimum spanning trees of weighted scale-free networks
Macdonald, P. J., Almaas, E., & Barabási, A.-Ĺ. (2005) · Europhysics Letters (EPL) · doi:10.1209/epl/i2005-10232-x · Cited by 122
Role of Synaptic Filtering on the Firing Response of Simple Model Neurons
Moreno‐Bote, R., & Parga, N. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.028102 · Cited by 90
Barthélemy, M., & Flammini, A. (2006) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2006/07/l07002 · Cited by 88
Spatial structure of the internet traffic
Barthélemy, M., Gondran, B., & Guichard, É. (2003) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)01382-1 · Cited by 79
Secondary extinctions in ecological networks: Bottlenecks unveiled
Allesina, S., Bodini, A., & Bondavalli, C. (2005) · Ecological Modelling · doi:10.1016/j.ecolmodel.2005.10.016 · Cited by 71
Geographical Coarse Graining of Complex Networks
Kim, B. J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.168701 · Cited by 61
Spatial Structure of the Internet Traffic
Barthélemy, M., Gondran, B., & Guichard, É. (2002) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 58
Cited by
Fake news on Twitter during the 2016 U.S. presidential election
Grinberg, N., Joseph, K., Friedland, L., Swire-Thompson, B., & Lazer, D. (2019) · Science · doi:10.1126/science.aau2706 · Cited by 1,803
Topographic organization of the human subcortex unveiled with functional connectivity gradients
Tian, Y., Margulies, D. S., Breakspear, M., & Zalesky, A. (2020) · Nature Neuroscience · doi:10.1038/s41593-020-00711-6 · Cited by 784
Human symptoms–disease network
Zhou, X., Menche, J., Barabási, A.-L., & Sharma, A. (2014) · Nature Communications · doi:10.1038/ncomms5212 · Cited by 653
Perspectives in Chemistry—Steps towards Complex Matter
Lehn, J. (2013) · Angewandte Chemie International Edition · doi:10.1002/anie.201208397 · Cited by 625
Flavor network and the principles of food pairing
Ahn, Y.-Y., Ahnert, S. E., Bagrow, J. P., & Barabási, A.-L. (2011) · Scientific Reports · doi:10.1038/srep00196 · Cited by 487
Metadata
- Authors
- Serrano, M. Á., Boguñá, M., & Vespignani, A.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2009-04-21
- Volume
- 106
- Issue
- 16
- Pages
- 6483-6488
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2038793346
- Cited by
- 892
- References
- 29
- FWCI
- 12.04
- Type
- journal article
- Language
- en
- Open access
- green
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
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.