The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Optimal Network Topologies for Local Search with Congestion
Open accessAbstract
The problem of searchability in decentralized complex networks is of great importance in computer science, economy, and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and we obtain expressions for the average search cost both in the presence and the absence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: starlike configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when it is large.
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
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
An Experimental Study of the Small World Problem
Travers, J., & Milgram, S. (1969) · Sociometry · doi:10.2307/2786545 · Cited by 1,863
Kleinberg, J. M. (2000) · Nature · doi:10.1038/35022643 · Cited by 1,737
Adamic, L. A., Lukose, R. M., Puniyani, A. R., & Huberman, B. A. (2001) · Physical Review E · doi:10.1103/physreve.64.046135 · Cited by 1,203
Cited by
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
Link prediction in complex networks: A survey
Lü, L., & Zhou, T. (2011) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.11.027 · Cited by 2,819
Characterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
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
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
Guimerà, R., Mossa, S., Turtschi, A., & Amaral, L. A. N. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407994102 · Cited by 1,762
Self-citationWho's Who in Networks. Wanted: The Key Player
Ballester, C., Calvó-Armengol, A., & Zenou, Y. (2006) · Econometrica · doi:10.1111/j.1468-0262.2006.00709.x · Cited by 1,291
Identifying influential nodes in complex networks
Chen, D., Lü, L., Shang, M.-S., Zhang, Y.-C., & Zhou, T. (2012) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.09.017 · Cited by 1,210
Watts, D. J. (2004) · Annual Review of Sociology · doi:10.1146/annurev.soc.30.020404.104342 · Cited by 1,163
Random Walks on Complex Networks
Noh, J. D., & Rieger, H. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.118701 · Cited by 1,148
Missing and spurious interactions and the reconstruction of complex networks
Guimerà, R., & Sales-Pardo, M. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0908366106 · Cited by 797
Self-citationCascade Control and Defense in Complex Networks
Motter, A. E. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.098701 · Cited by 776
The H-index of a network node and its relation to degree and coreness
Lü, L., Zhou, T., Zhang, Q.-M., & Stanley, H. E. (2016) · Nature Communications · doi:10.1038/ncomms10168 · Cited by 690
The physics of spreading processes in multilayer networks
De Domenico, M., Granell, C., Porter, M. A., & Arenas, A. (2016) · Nature Physics · doi:10.1038/nphys3865 · Cited by 649
Efficient routing on complex networks
Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., & Wang, B.-H. (2006) · Physical Review E · doi:10.1103/physreve.73.046108 · Cited by 631
Navigability of interconnected networks under random failures
De Domenico, M., Solé-Ribalta, A., Gómez, S., & Arenas, A. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1318469111 · Cited by 548
Self-citationRanking in interconnected multilayer networks reveals versatile nodes
De Domenico, M., Solé-Ribalta, A., Omodei, E., Gómez, S., & Arenas, A. (2015) · Nature Communications · doi:10.1038/ncomms7868 · Cited by 459
Onset of traffic congestion in complex networks
Zhao, L., Lai, Y.-C., Park, K., & Ye, N. (2005) · Physical Review E · doi:10.1103/physreve.71.026125 · Cited by 457
Traffic dynamics based on local routing protocol on a scale-free network
Wang, W.-X., Wang, B.-H., Yin, C.-Y., Xie, Y.-B., & Zhou, T. (2006) · Physical Review E · doi:10.1103/physreve.73.026111 · Cited by 382
Entangled Networks, Synchronization, and Optimal Network Topology
Donetti, L., Hurtado, P. I., & Muñoz, M. A. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.188701 · Cited by 346
Multilayer Networks: Structure and Function
Bianconi, G. (2018) · doi:10.1093/oso/9780198753919.001.0001 · Cited by 334
Structure identification of uncertain general complex dynamical networks with time delay
Liu, H., Lu, J.-A., Lü, J., & Hill, D. J. (2009) · Automatica · doi:10.1016/j.automatica.2009.03.022 · Cited by 268
A spectrum of routing strategies for brain networks
Avena-Koenigsberger, A., Yan, X., Kolchinsky, A., van den Heuvel, M. P., Hagmann, P., & Sporns, O. (2019) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1006833 · Cited by 115
Metadata
- Authors
- Guimerà, R., Díaz-Guilera, A., Vega-Redondo, F., Cabrales, A., & Arenas, A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2002-11-21
- Volume
- 89
- Issue
- 24
- Pages
- 248701-248701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2107047240
- Cited by
- 605
- References
- 22
- FWCI
- 8.99
- Type
- journal article
- Language
- en
- Open access
- bronze
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.