Navigability evaluation of complex networks by greedy routing efficiency
- PMID: 30630863
- PMCID: PMC6358708
- DOI: 10.1073/pnas.1817880116
Navigability evaluation of complex networks by greedy routing efficiency
Conflict of interest statement
The authors declare no conflict of interest.
Figures
Comment in
-
Reply to Muscoloni and Cannistraci: Navigation performance measures.Proc Natl Acad Sci U S A. 2019 Jan 29;116(5):1470. doi: 10.1073/pnas.1820315116. Epub 2019 Jan 10. Proc Natl Acad Sci U S A. 2019. PMID: 30630947 Free PMC article. No abstract available.
Comment on
-
Navigation of brain networks.Proc Natl Acad Sci U S A. 2018 Jun 12;115(24):6297-6302. doi: 10.1073/pnas.1801351115. Epub 2018 May 30. Proc Natl Acad Sci U S A. 2018. PMID: 29848631 Free PMC article.
References
-
- Kleinberg JM. Navigation in a small world. Nature. 2000;406:845. - PubMed
-
- Boguñá M, Krioukov D, Claffy KC. Navigability of complex networks. Nat Phys. 2008;5:74–80.
-
- Boguñá M, Papadopoulos F, Krioukov D. Sustaining the Internet with hyperbolic mapping. Nat Commun. 2010;1:62. - PubMed
-
- Papadopoulos F, Psomas C, Krioukov D. Network mapping by replaying hyperbolic growth. IEEE/ACM Trans Netw. 2015;23:198–211.
-
- Papadopoulos F, Aldecoa R, Krioukov D. Network geometry inference using common neighbors. Phys Rev E Stat Nonlin Soft Matter Phys. 2015;92:022807. - PubMed
Publication types
MeSH terms
LinkOut - more resources
Full Text Sources
