Navigating Low-Dimensional and Hierarchical Population Networks

DOI10.1007/11841036_44zbMATH Open1131.91384OpenAlexW2145870080MaRDI QIDQ5449552FDOQ5449552

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Recovering the long-range links in augmented graphs
• Low-Distortion Inference of Latent Similarities from a Multiplex Social Network
• Depth of Field and Cautious-Greedy Routing in Social Networks
• Highway preferential attachment models for geographic routing
• Abstract geometrical computation. IV: Small Turing universal signal machines
• Search in social networks using MCMC algorithm
• Greedy routing and the algorithmic small-world phenomenon
• Networks Become Navigable as Nodes Move and Forget

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)