Augmented graph models for small-world analysis with geographical factors

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 213-227

  Van Nguyen, ^a   Martel, Chip ^b  

^a CNRS   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; PROBABILITY DISTRIBUTIONS;

AUGMENTED GRAPH; CLUSTERINGS; COMMON FEATURES; GRAPH MODEL; LARGE-SCALES; POWER-LAW; PROPERTY; RANDOM LINKS; REAL-WORLD NETWORKS; SMALL WORLDS;

GRAPH THEORY;

EID: 58349109061     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. I. Abraham, D. Malkhi, and O. Dobzinski, "Land: Stretch (1 + ε) locality-aware networks for dhts," in Proc. of ACM Symp. on Discrete Algorithms (SODA), 2004.
2. L. Barriere, P. Fraigniaud, E. Kranakis, and D. Krizanc, "Efficient routing in networks with long range contacts," in 15th Intr. Symp. on Dist. Comp., DISC'01, pp. 270-284.
3. I. Benjamini and N. Berger, "The diameter of a long-range percolation clusters on finite cycles," Random Structures and Algorithms, vol. 19, no. 2, pp. 102-111, 2001.
4. B. Bollobas, "Random graphs," vol. 44, pp. 1-20, 1991.
5. -, Random Graphs, 2nd ed. Cambridge University Press, 2001, ch. 10.
6. F. Chung and L. Lu, "Connected components in random graphs with given degree sequences," Annals of Combinatorics, vol. 6, pp. 125-145, 2002.
7. -, "The average distances in random graphs with given expected degrees," Internet Mathematics, vol. 1, pp. 91-114, 2003.
8. D. Coppersmith, D. Gamarnik, and M. Sviridenko, "The diameter of a long- range percolation graph," Random Structures and Algorithms, vol. 21, no. 1, pp. 1-13, 2002.
9. S. Dolev, E. Kranakis, D. Krizanc, and D. Peleg, "Bubbles: Adaptive routing scheme for high-speed dynamic networks," SIAM J. Comput., vol. 29, no. 3, pp. 804-833, 1999.
10. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel, "Could any graph be turned into a small-world?" Theor. Comput. Sci., vol. 355, no. 1, pp. 96-103, 2006.
11. -, "Towards small world emergence," in 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006, pp. 225-232.
12. C. Faloutsos, P. Faloutsos, and M. Faloutsos, "On power-law relationships of the internet topology," in Proc. of ACM SIGCOMM, 1999.
13. P. Fraigniaud, "A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs," in In 13th Annual European Symposium on Algorithms (ESA), 2005.
14. -, "Small worlds as navigable augmented networks: Model, analysis, and validation," in In 15th Annual European Symposium on Algorithms (ESA), 2007.
15. P. Fraigniaud, C. Gavoille, and C. Paul, "Eclecticism shrinks the world," in Proc. of ACM Symp. on Princ. of Dist. Comp. (PODC), 2004, pp. 169-178.
16. P. Fraigniaud, E. Lebha, and Z. Lotker, "A doubling dimension threshold θ(log log n) for augmented graph nagavibility," in In 14th Annual European Symposium on Algorithms (ESA), 2006.
17. J. Gao and L. Zhang, "Tradeoffs between stretch factor and load balancing ratio in routing on growth restrict graphs," in Proc. of ACM Symp. on Princ. of Dist. Comp. (PODC), 2004.
18. A. Helmy, "Small worlds in wireless networks," IEEE Commun. Lett., vol. 7, no. 10, pp. 490-492, Oct. 2003.
19. D. Karger and M. Ruhl, "Finding nearest neighbors in growth-restricted metrics," in Proc. of ACM Symp. on Theory of Computing (STOC), 2002.
20. J. Kleinberg, "The small-world phenomenon: An algorithmic perspective," in Proc. of ACM Symp. on Theory of Computing (STOC), 2000.
21. -, "Small-world phenomena and the dynamics of information," in Neural Info. Proce. Sys. (NIPS), 2001.
22. -, "Complex networks and decentralized search algorithms," in Proceedings of the International Congress of Mathematicians (ICM), 2006.
23. R. Kumar, D. Liben-Nowell, and A. Tomkins, "Navigating low-dimensional and hierarchical population networks," in In 14th Annual European Symposium on Algorithms (ESA), 2006, pp. 480-491.
24. A. Lakhina, J. W. Byers, M. Crovella, and I. Matta, "On the geographic location of internet resources," IEEE Journal of Selected Areas in Communications, vol. 21, no. 6, 2003.
25. E. Lebhar and N. Schabanel, "Almost optimal decentralized routing in long-range contact networks," in International Colloquium on Automata, Languages and Programming, 2004, pp. 894-905.
26. D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins, "Geographic routing in social networks," In Proceedings of the National Academy of Sciences, vol. 102, no. 33, pp. 11623-11628, 2005.
27. C. Martel and V. Nguyen, "Analyzing Kleinberg's (and other) smallworld models," in Proc. of ACM Symp. on Princ. of Dist. Comp. (PODC), 2004.
28. S. Milgram, "The small world problem," Psychology Today, vol. 22, pp. 61-67, 1967.
29. V. Nguyen and C. Martel, "Analyzing and characterizing small-world graphs," in Proc. of ACM Symp. on Discrete Algorithms (SODA), 2005.
30. -, "Designing low cost networks with short routes and low congestion," in Proc. of IEEE INFOCOM, 2006.
31. C. G. Plaxton, R. Rajaraman, and A. W. Richa, "Accessing nearby copies of replicated objects in a distributed environment," in 9th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 1997, pp. 311-320.
32. A. Slivkins, "Distance estimation and object location via rings of neighbors," in Proc. of ACM Symp. on Princ. of Dist. Comp. (PODC), 2005.
33. D. Watts and S. Strogatz, "Collective dynamics of small-world networks," Nature, vol. 393, pp. 440-32, 1998.
34. S. Yook, H. Jeong, and A. Barabasi, "Modeling the internets large-scale topology," in Proceedings of the National Academy of Sciences, vol. 99, 2002, pp. 13 382-13386.