Analyzing and characterizing small-world graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 311-320

  Van Nguyen, ^a   Martel, Chip ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GOSSIP PROTOCOLS; RANDOM GRAPHS; SMALL-WORLD GRAPHS; SMALL-WORLD MODELS;

COMPUTER NETWORKS; FUNCTIONS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

GRAPH THEORY;

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

References (25)

1. J. Aspnes, Z. Diamadi, G. Shah, "Fault-tolerant Routing in Peer-to-peer Systems", Proc. 22nd ACM Symp. on Princ. of Dist. Comp., PODC'02, p. 223-232
2. L. Barriere, P. Fraigniaud, E. Kranakis, D. Krizanc, "Efficient Routing in Networks with Long Range Contacts", Proc. 15th Intr. Symp. on Dist. Comp., DISC'01, p. 270-284
3. I. Benjamini and N. Berger, "The Diameter of a Long-Range Percolation Clusters on Finite Cycles" Random Structures and Algorithms, 19,2:102-111 (2001).
4. M. Biskup, "Graph Diameter in Long-range percolation", submitted to Electron. Comm. Probab.
5. B. Bollobas, "The Diameter of Random Graphs", IEEE Trans. Inform. Theory 36 (1990), no. 2, 285-8.
6. B. Bollobas, F.R.K. Chung, "The diameter of a cycle plus a random matching", SIAM J. Discrete Math. 1,328-333 (1988)
7. F. Chung and L. Lu, "The Diameter of Random Sparse Graphs", Adva. in App. Math. 26 (2001), 257-279.
8. D. Coppersmith, D. Gamarnik, and M. Sviridenko "The diameter of a long- range percolation graph", Random Structures and Algorithms, 21,1:1-13 (2002).
9. P. Dodds, R. Muhamad, and D. Watts, "An experimental study of search in global social networks", Science, 301:827-9, 2003.
10. P. Erdos and A. Renyi, "On random graphs", Publicationes Mathematicas 6, 290-7 (1959).
11. P. Fraigniaud, C. Gavoille and Christophe Paul, "Eclecticism Shrinks the World", Proc. 23rd ACM Symp. on Princ. of Dist. Comp. PODC'04, p. 169-178.
12. J. Gao and L. Zhang, "Tradeoffs between Stretch Factor and Load Balancing Ratio in Routing on Growth Restrict Graphs", Proc. 23rd ACM Symp. on Princ. of Dist. Comp. PODC'04, p. 189-196.
13. R. Karp, "Probabilistic Recurrence Relations", in Journal of the ACM 41(6):1136-1150, Nov. 1994.
14. D. Kemper, J. Kleinberg, and A. Demers, "Spatial gossip and resource location protocols", in Proc. ACM Symp. Theory of Computing, 163-172, 2001.
15. J. Kleinberg, "Small-World Phenomena and the Dynamics of Information", in Advances in Neural Information Processing Systems (NIPS) 14, 2001.
16. J. Kleinberg, "The Small-World Phenomenon: An Algorithmic Perspective", in Proc. 32nd ACM Symp. Theory of Comp., 163-170, 2000.
17. M. Kochen, Ed., The Small-World (Ablex, Norwood, 1989)
18. G. S. Manku and M. Naor and U. Wieder, "Know Thy Neighbour's Neighbour: The Role of Lookahead in Randomized P2P Networks", Proc. 36th ACM Symp. on Theory of Comp. STOC'04, p. 54-63.
19. C. Martel and V. Nguyen, "The complexity of message delivery in Kleinberg's Small-world Model", Tech-Report CSE-2003-23, CS-UCDavis, 2003.
20. C. Martel and V. Nguyen, "Analyzing Kleinberg's (and other) Smallworld Models", Proc. 23rd ACM Symp. on Princ. of Dist. Comp. PODC'04, pp. 179-188.
21. D. Malkhi, M. Naor, D. Ratajczak, "Viceroy: A Scalable and Dynamic Emulation of the Butterfly", Proc. 21st ACM Symp. on Princ. of Dist. Comp., p. 183-192.
22. S. Milgram, "The small world problem" Psychology Today 1,61 (1967).
23. V. Nguyen and C. Martel, "Analysis and Models for Small-World Graphs", Tech-Report CS-UCDavis, 2004. www.cs.ucdavis.edu/~martel/main/ smallworld.tech.pdf
24. D. Watts and S. Strogatz, "Collective Dynamics of small-world networks" Nature 393,p. 440-2 (1998).
25. H. Zhang, A. Goel and R. Gividan, "Using the Small-World Model to Improve Freenet Performance", IEEE INFOCOM'02, vol. 21(1), pp. 1228-37.