The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Navigability of interconnected networks under random failures
Open accessAbstract
Significance: Network theory has been exploited in the last decades to deepen our comprehension of complex systems. However, real-world complex systems exhibit multiple levels of relationships and require modeling by interconnected networks, characterizing interactions on several levels simultaneously. Questions such as “what is the efficiency of exploration of a city using the multiple transportation layers, like subway and bus?” and “what is its resilience to failures?” have to be answered using the multiplex framework. Here, we introduce fundamental mechanisms to perform such exploration, using random walks on multilayer networks, and we show how the topological structure, together with the navigation strategy, influences the efficiency in exploring the whole structure.
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
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Catastrophic cascade of failures in interdependent networks
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010) · Nature · doi:10.1038/nature08932 · Cited by 4,513
Traffic and related self-driven many-particle systems
Helbing, D. (2001) · Reviews of Modern Physics · doi:10.1103/revmodphys.73.1067 · Cited by 3,245
RANDOM DISPERSAL IN THEORETICAL POPULATIONS
SKELLAM, J. G. (1951) · Biometrika · doi:10.1093/biomet/38.1-2.196 · Cited by 2,470
A measure of betweenness centrality based on random walks
Newman, M. E. J. (2005) · Social Networks · doi:10.1016/j.socnet.2004.11.009 · Cited by 2,461
Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010) · Science · doi:10.1126/science.1184819 · Cited by 2,123
Havlin, S., & Ben-Avraham, D. (1987) · Advances in Physics · doi:10.1080/00018738700101072 · Cited by 1,808
On the evolution of random graphs
Erdös, P., & Rényi, A. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.38 · Cited by 1,757
Kleinberg, J. M. (2000) · Nature · doi:10.1038/35022643 · Cited by 1,737
Long-range correlations in nucleotide sequences
Peng, C.-K., Buldyrev, S. V., Goldberger, A. L., Havlin, S., Sciortino, F., Simons, M., & Stanley, H. E. (1992) · Nature · doi:10.1038/356168a0 · Cited by 1,410
Optimizing the success of random searches.
Viswanathan, G. M., Buldyrev, S. V., Havlin, S., da Luz, M. G. E., Raposo, E. P., & Stanley, H. E. (1999) · Nature · doi:10.1038/44831 · Cited by 1,359
Walking the Interactome for Prioritization of Candidate Disease Genes
Köhler, S., Bauer, S., Horn, D., & Robinson, P. N. (2008) · The American Journal of Human Genetics · doi:10.1016/j.ajhg.2008.02.013 · Cited by 1,258
Networks formed from interdependent networks
Gao, J., Buldyrev, S. V., Stanley, H. E., & Havlin, S. (2012) · Nature Physics · doi:10.1038/nphys2180 · Cited by 1,216
Random Walks on Complex Networks
Noh, J. D., & Rieger, H. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.118701 · Cited by 1,148
Diffusion Dynamics on Multiplex Networks
Gómez, S., Díaz-Guilera, A., Gómez-Gardeñes, J., Pérez-Vicente, C. J., Moreno, Y., & Arenas, A. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.028701 · Cited by 1,003
Self-citationMultirelational organization of large-scale social networks in an online world
Szell, M., Lambiotte, R., & Thurner, S. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1004008107 · Cited by 930
Wilson, R. J. (1972) · Cited by 926
Havlin, S., & Ben-Avraham, D. (2002) · Advances in Physics · doi:10.1080/00018730110116353 · Cited by 902
(2023) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789811273117_0001 · Cited by 885
First-passage times in complex scale-invariant media
Condamin, S., Bénichou, O., Tejedor, V., Voituriez, R., & Klafter, J. (2007) · Nature · doi:10.1038/nature06201 · Cited by 627
Optimal Network Topologies for Local Search with Congestion
Guimerà, R., Díaz-Guilera, A., Vega-Redondo, F., Cabrales, A., & Arenas, A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.248701 · Cited by 605
Self-citationNeutral evolution of mutational robustness
van Nimwegen, E., Crutchfield, J. P., & Huynen, M. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.17.9716 · Cited by 568
Abrupt transition in the structural formation of interconnected networks
Radicchi, F., & Arenas, A. (2013) · Nature Physics · doi:10.1038/nphys2761 · Cited by 348
Self-citationRandom walks and the effective resistance of networks
Tetali, P. (1991) · Journal of Theoretical Probability · doi:10.1007/bf01046996 · Cited by 310
Epidemics on interconnected networks
Dickison, M., Havlin, S., & Stanley, H. E. (2012) · Physical Review E · doi:10.1103/physreve.85.066109 · Cited by 281
Mathematical models and applications, with emphasis on the social, life, and management sciences
Mäki, D. P., & Thompson, M. (1973) · Prentice Hall eBooks · Cited by 259
Agents, Cells, and Cities: New Representational Models for Simulating Multiscale Urban Dynamics
Batty, M. (2005) · Environment and Planning A: Economy and Space · doi:10.1068/a3784 · Cited by 228
Localization of the Maximal Entropy Random Walk
Burda, Z., Duda, J., Luck, J. M., & Waclaw, B. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.160602 · Cited by 187
Towards Design Principles for Optimal Transport Networks
Li, G., Reis, S. D. S., Moreira, A. A., Havlin, S., Stanley, H. E., & Andrade, J. S. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.018701 · Cited by 178
Exploring complex networks by walking on them
Yang, S.-J. (2005) · Physical Review E · doi:10.1103/physreve.71.016107 · Cited by 169
Spectral Coarse Graining of Complex Networks
Gfeller, D., & Rios, P. D. L. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.038701 · Cited by 164
Maximal-entropy random walks in complex networks with limited information
Sinatra, R., Gómez‐Gardeñes, J., Lambiotte, R., Nicosia, V., & Latora, V. (2011) · Physical Review E · doi:10.1103/physreve.83.030103 · Cited by 146
Samukhin, A. N., Dorogovtsev, S. N., & Mendes, J. F. F. (2008) · Physical Review E · doi:10.1103/physreve.77.036115 · Cited by 137
Approximating PageRank from In-Degree
Fortunato, S., Boguñá, M., Flammini, A., & Menczer, F. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78808-9_6 · Cited by 134
Exploring complex networks through random walks
Costa, L. D. F., & Travieso, G. (2007) · Physical Review E · doi:10.1103/physreve.75.016102 · Cited by 119
Territory covered by N diffusing particles
Larralde, H., Trunfio, P. A., Havlin, S., Stanley, E., & Weiss, G. H. (1992) · Nature · doi:10.1038/355423a0 · Cited by 119
An integrative approach for causal gene identification and gene regulatory pathway inference
Tu, Z., Wang, L., Arbeitman, M. N., Chen, T., & Sun, F. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl234 · Cited by 95
Self-organized complexity in economics and finance
Stanley, E., Amaral, L. A. N., Buldyrev, S. V., Gopikrishnan, P., Plerou, V., & Salinger, M. A. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.022582899 · Cited by 82
From the physics of interacting polymers to optimizing routes on the London Underground
Yeung, C. H., Saad, D., & Wong, K. Y. M. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1301111110 · Cited by 67
Statistics of cycles: how loopy is your network?
Rozenfeld, H. D., Kirk, J. E., Bollt, E. M., & ben‐Avraham, D. (2005) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/38/21/005 · Cited by 60
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Self-citationNewman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Human mobility: Models and applications
Barbosa, H., Barthelemy, M., Ghoshal, G., James, C. R., Lenormand, M., Louail, T., Menezes, R., Ramasco, J. J., Simini, F., & Tomasini, M. (2018) · Physics Reports · doi:10.1016/j.physrep.2018.01.001 · Cited by 1,027
Structural reducibility of multilayer networks
De Domenico, M., Nicosia, V., Arenas, A., & Latora, V. (2015) · Nature Communications · doi:10.1038/ncomms7864 · Cited by 661
Random walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
Metadata
- Authors
- De Domenico, M., Solé-Ribalta, A., Gómez, S., & Arenas, A.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2014-05-27
- Volume
- 111
- Issue
- 23
- Pages
- 8351-8356
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W1807089695
- Cited by
- 548
- References
- 43
- FWCI
- 31.42
- 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.