Category-based routing in social networks: membership dimension and the small-world phenomenon

DOI10.1016/j.tcs.2013.04.027zbMath1278.91121arXiv1110.4499OpenAlexW2954747556MaRDI QIDQ386908

Lowell Trott, Darren Strash, Maarten Löffler, Michael T. Goodrich, David Eppstein

Publication date: 11 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.4499

zbMATH Keywords

social networkcategory routingmembership dimensionsmall world

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10)

Related Items (1)

A study of how the Watts-Strogatz model relates to an economic system's utility

Cites Work

• Some results on greedy embeddings in metric spaces
• Could any graph be turned into a small-world?
• Optimum binary search trees
• On a conjecture related to geometric routing
• Geometric ad-hoc routing
• The small-world phenomenon
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• Succinct Greedy Geometric Routing in the Euclidean Plane
• Biased Search Trees
• A general model of web graphs
• Collective dynamics of ‘small-world’ networks
• Analyzing Kleinberg's (and other) small-world Models
• An Algorithm to Construct Greedy Drawings of Triangulations
• Models of the small world.
• Routing with guaranteed delivery in ad hoc wireless networks

This page was built for publication: Category-based routing in social networks: membership dimension and the small-world phenomenon