Could any graph be turned into a small-world?

Theoretical Computer Science

Volumn 355, Issue 1, 2006, Pages 96-103

  Duchon, Philippe ^a   Hanusse, Nicolas ^a   Lebhar, Emmanuelle ^b   Schabanel, Nicolas ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Random graph model; Routing algorithm; Small world

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; RANDOM PROCESSES;

RANDOM GRAPH MODEL; ROUTING ALGORITHM; SMALL-WORLD;

GRAPH THEORY;

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

References (15)

1. L. Barrière, P. Fraigniaud, E. Kranakis, D. Krizanc, Efficient routing in networks with long-range contacts. in: Proc. 15th Internat. Conf. on Distributed Computing (DISC), 2001, pp. 270-284.
2. L. Bartholdi, Groups of intermediate growth, preprint oai:arxiv.org:math/0201293. preprint oai:arxiv.org:math/0201293 (20040622), 2002.
3. D. Coppersmith, D. Gamarnik, and M. Sviridenko The diameter of a long-range percolation graph Random Struct. Algorithms 21 1 2002 1 13
4. P. Fraigniaud, Greedy routing in tree-decomposed graphs: a new perspective on the small-world phenomenon, Technical Report LRI-1397, University of Paris Sud, February 2005.
5. P. Fraigniaud, C. Gavoille, C. Paul, Eclecticism shrinks even small worlds, in: Proc. 23rd ACM Symp. on Principles of Distributed Computing (PODC), 2004, pp. 169-178.
6. R.I. Grigorchuk, On growth in group theory, in: Proc. Internat. Congress of Mathematicians, Kyoto, 1990, pp. 325-338.
7. J. Kleinberg, The small-world phenomenon: an algorithmic perspective, in: Proc. 32nd ACM Symp. on Theory of Computing (STOC), 2000, pp. 163-170.
8. J. Kleinberg, Small-world phenomena and the dynamics of information, in: T.G. Dietterich, S. Becker, Z. Ghahramani (Eds.), Advances in Neural Information Processing Systems (NIPS), vol. 14, MIT Press, Cambridge, MA, 2002.
9. E. Lebhar, N. Schabanel, Almost optimal decentralized routing in long-range contact networks, in: Proc. 31st Internat. Colloq. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, Springer, Berlin, 2004, pp. 894-905.
10. G.S. Manku, M. Naor, U. Wieder, Know thy neighbor's neighbor: the power of lookahead in randomized p2p networks, in: Proc. 36th ACM Symp. on Theory of Computing (STOC), 2004.
11. C. Martel, V. Nguyen, Analyzing Kleinberg's (and other) small-world models, in: Proc. 23rd Annu. ACM Symp. on Principles of Distributed Computing, 2004, pp. 179-188.
12. S. Milgram, The small world problem, Psychol. Today 61 (1) (1967).
13. M.E.J. Newman, and D.J. Watts Scaling and percolation in the small-world network model Phys. Rev. 60 1999 7332 7342
14. V. Nguyen, C. Martel. Analyzing and characterizing small-world graphs. in: Proc. 15th ACM Symp. on Discrete Algorithms SODA, 2005, pp. 311-320.
15. D. Watts, and S. Strogatz Collective dynamics of small-world networks Nature 393 1998 440 442