Navigating Low-Dimensional and Hierarchical Population Networks

DOI10.1007/11841036_44MaRDI QIDQ5449552zbMATHOpenAlexFDO

Authors Ravi Kumar, David Liben-Nowell, Andrew Tomkins

Publication date 11 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11841036_44

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Recommendations

• Depth of Field and Cautious-Greedy Routing in Social Networks
• The small-world phenomenon: an algorithmic perspective
• Networks Become Navigable as Nodes Move and Forget
• Close to optimal decentralized routing in long-range contact networks
• Automata, Languages and Programming

Cited in

(11)

• Depth of Field and Cautious-Greedy Routing in Social Networks
• Navigation in real-world complex networks through embedding in latent spaces
• Fellow travelers phenomenon present in real-world networks
• Orientation in social networks
• Search in social networks using MCMC algorithm
• Highway preferential attachment models for geographic routing
• Abstract geometrical computation. IV: Small Turing universal signal machines
• Networks Become Navigable as Nodes Move and Forget
• Low-distortion inference of latent similarities from a multiplex social network
• Greedy routing and the algorithmic small-world phenomenon
• Recovering the long-range links in augmented graphs

This page was built for publication: Navigating Low-Dimensional and Hierarchical Population Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449552)