Analyzing and characterizing small-world graphs

MaRDI QIDQ2921684zbMATH OpenFDO

Authors Van Nguyen, Chip Martel

Publication date 13 October 2014

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Analyzing Kleinberg's (and other) small-world models
• On the connectivity and diameter of small-world networks
• Could any graph be turned into a small-world?
• Navigable small-world networks with few random bits
• How Much Independent Should Individual Contacts Be to Form a Small–World?

Cited in

(17)

• Universal augmentation schemes for network navigability
• The clustering coefficient and the diameter of small-world networks
• Distance estimation and object location via rings of neighbors
• Greedy routing in small-world networks with power-law degrees
• Could any graph be turned into a small-world?
• Discrete small world networks
• Justifying the small-world phenomenon via random recursive trees
• Small-world graphs: characterization and alternative constructions
• The idemetric property: when most distances are (almost) the same
• Augmented graph models for small-world analysis with geographical factors
• Low-distortion inference of latent similarities from a multiplex social network
• Algorithms and Models for the Web-Graph
• Distributed Computing
• On the connectivity and diameter of small-world networks
• Analyzing Kleinberg's (and other) small-world models
• Asymptotically optimal solutions for small world graphs
• Recovering the long-range links in augmented graphs

This page was built for publication: Analyzing and characterizing small-world graphs

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