Recovering the long-range links in augmented graphs

@article{Fraigniaud2010RecoveringTL,
  title={Recovering the long-range links in augmented graphs},
  author={Pierre Fraigniaud and Emmanuelle Lebhar and Zvi Lotker},
  journal={Theor. Comput. Sci.},
  year={2010},
  volume={411},
  pages={1613-1625}
}
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair (H,φ), where H is a graph in which inter-node distances are supposed to be easy to compute or at least easy to estimate. This graph is ”augmented” by links, called long range links, which are selected according to the probability distribution φ. The augmented graph model enables the analysis of greedy routing in… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…