Recovering the long-range links in augmented graphs

Theoretical Computer Science

Volumn 411, Issue 14-15, 2010, Pages 1613-1625

  Fraigniaud, Pierre ^a   Lebhar, Emmanuelle ^a   Lotker, Zvi ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Bounded growth; Doubling dimension; Small world

Indexed keywords

AUGMENTED GRAPH; CLUSTERING COEFFICIENT; DOUBLING DIMENSIONS; GRAPH G; GREEDY ROUTING; INTERMEDIATE NODE; LOCAL MAXIMUM LIKELIHOOD; LONG-RANGE LINKS; SMALL WORLDS; SOCIAL NETWORKS;

PROBABILITY DISTRIBUTIONS;

MAXIMUM LIKELIHOOD ESTIMATION;

EID: 76849097214     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.01.009     Document Type: Article

References (39)

1. I. Abraham, C. Gavoille, Object location using path separators, in: 25th ACM Symp. on Principles of Distributed Computing, PODC, 2006, pp. 188-197
2. I. Abraham, D. Malkhi, O. Dobzinski, LAND: Stretch (1 + ε{lunate}) locality aware networks for DHTs, in: ACM-SIAM Symposium on Discrete Algorithms, SODA, 2004
3. Andersen R., Chung F., and Lu L. Modeling the small-world phenomenon with local network flow. Internet Mathematics 2 3 (2006) 359-385
4. D. Achlioptas, A. Clauset, D. Kempe, C. Moore, On the bias of Traceroute sampling, or: Power-law degree distributions in regular graphs, in: 37th ACM Symposium on Theory of Computing, STOC, 2005
5. J. Aspnes, Z. Diamadi, G. Shah, Fault-tolerant routing in peer-to-peer systems, in: 21st ACM Symp. on Principles of Distributed Computing, PODC, 2002, pp. 223-232
6. Barabási A., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509-512
7. Barrière L., Fraigniaud P., Kranakis E., and Krizanc D. Efficient routing in networks with long-range contacts. 15th International Symposium on Distributed Computing. DISC. LNCS vol. 2180 (2001) 270-284
8. Chung F., and Lu L. The small world phenomenon in hybrid power law graphs. Lect. Notes Phys. vol. 650 (2004) 89-104
9. Dodds P., Muhamad R., and Watts D. An experimental study of search in global social networks. Science 301 5634 (2003) 827-829
10. Duchon P., Hanusse N., Lebhar E., and Schabanel N. Could any graph be turned into a small-world?. Theoretical Computer Science 355 1 (2006) 96-103
11. P. Duchon, N. Hanusse, E. Lebhar, N. Schabanel, Towards small world emergence, in: 18th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA, 2006, pp. 225-232
12. Flammini M., Moscardelli L., Navarra A., and Perennes S. Asymptotically optimal solutions for small world graphs. 19th International Symposium on Distributed Computing. DISC. LNCS vol. 3724 (2005) 414-428
13. P. Fraigniaud, Greedy routing in tree-decomposed graphs: A new perspective on the small-world phenomenon, in: 13th Annual European Symposium on Algorithms, ESA, 2005, pp. 791-802
14. P. Fraigniaud, C. Gavoille, A. Kosowski, E. Lebhar, Z. Lotker, Universal augmentation schemes for network navigability: Overcoming the sqrt(n)-barrier, in: 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, 2007
15. P. Fraigniaud, C. Gavoille, C. Paul, Eclecticism shrinks even small worlds, in: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, PODC, 2004, pp. 169-178
16. Fraigniaud P., Lebhar E., and Lotker Z. A doubling dimension threshold Θ (log log n) for augmented graph navigability. 14th European Symposium on Algorithm. ESA. LNCS vol. 4168 (2006) 376-386
17. A. Gupta, R. Krauthgamer, J. Lee, Bounded geometries, fractals, and low- distortion embeddings, in: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2003, pp. 534-543
18. Heinonen J. Lectures on Analysis on Metric Spaces (2001), Springer-Verlag
19. Har-Peled S., and Mendel M. Fast construction of nets in low dimensional metrics, and their applications. SICOMP 35 5 (2006) 1148-1184
20. A. Iamnitchi, M. Ripeanu, I. Foster, Small-world file-sharing communities, in: 23rd Joint Conference of the IEEE Computer and Communications Societies, INFOCOM, 2004, pp. 952-963
21. D. Karger, M. Ruhl, Finding nearest neighbors in growth-restricted metrics, in: 34th ACM Symp. on the Theory of Computing, STOC, 2002, pp. 63-66
22. Kay S.M. Fundamentals of Statistical Signal Processing: Estimation Theory (1993), Prentice Hall (Chapter 7)
23. J. Kleinberg, The small-world phenomenon: An algorithmic perspective, in: 32nd ACM Symp. on Theory of Computing, STOC, 2000, pp. 163-170
24. Kleinberg J. Small-world phenomena and the dynamics of information. Advances in Neural Information Processing Systems (NIPS) 14 (2001)
25. J. Kleinberg, Complex networks and decentralized search algorithm, in: Nevanlinna prize presentation at the International Congress of Mathematicians, ICM, Madrid, 2006
26. D. Krioukov, K. Fall, X. Yang, Compact routing on Internet-like graphs, in: 23rd Conference of the IEEE Communications Society, INFOCOM, 2004
27. Kumar R., Liben-Nowell D., and Tomkins A. Navigating low-dimensional and hierarchical population networks. 14th European Symposium on Algorithm. ESA. LNCS vol. 4168 (2006)
28. Liben-Nowell D., Novak J., Kumar R., Raghavan P., and Tomkins A. Geographic routing in social networks. Proc. of the Natl. Academy of Sciences of the USA 102/3 (2005) 11623-11628
29. Lebhar E., and Schabanel N. Searching for Optimal paths in long-range contact networks. 31st International Colloquium on Automata, Languages and Programming. ICALP. LNCS vol. 3142 (2004) 894-905
30. G. Manku, M. Naor, U. Wieder, Know thy neighbor's neighbor: The power of lookahead in randomized P2P networks, in: 36th ACM Symp. on Theory of Computing, STOC, 2004, pp. 54-63
31. C. Martel, V. Nguyen, Analyzing Kleinberg's (and other) small-world models, in: 23rd ACM Symp. on Principles of Distributed Computing, PODC, 2004, pp. 179-188
32. C. Martel, V. Nguyen, Analyzing and characterizing small-world graphs, in: 16th ACM-SIAM Symp. on Discrete Algorithms, SODA, 2005, pp. 311-320
33. C. Martel, V. Nguyen, Designing networks for low weight, small routing diameter and low congestion, in: 25th Conference of the IEEE Communications Society, INFOCOM, 2006
34. Milgram S. The small-world problem. Psychology Today (1967) 60-67
35. Newman M. The structure and function of complex networks. SIAM Review 45 (2003) 167-256
36. In: Newman M., Barabasi A., and Watts D. (Eds). The Structure and Dynamics of Complex Networks (2006), Princeton University Press, Princeton
37. Pastor-Satorras R., and Vespignani A. Evolution and Structure of the Internet: A Statistical Physics Approach (2004), Cambridge University Press
38. A. Slivkins, Distance estimation and object location via rings of neighbors, in: 24th Annual ACM Symposium on Principles of Distributed Computing, PODC, 2005, pp. 41-50
39. Watts D., and Strogatz S. Collective dynamics of small-world networks. Nature 393 (1998) 440-443