Eclecticism shrinks even small worlds

Distributed Computing

Volumn 18, Issue 4, 2006, Pages 279-291

  Fraigniaud, Pierre ^a   Gavoille, Cyril ^b   Paul, Christophe ^c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c LIRMM   (France)

Author keywords

Milgram's experiment; Routing; Small world graphs

Indexed keywords

MILGRAM'S EXPERIMENT; ROUTING; SMALL WORLD GRAPHS;

DECISION THEORY; HARMONIC ANALYSIS; NETWORK PROTOCOLS; ROUTERS; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

GRAPH THEORY;

EID: 33646527603     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-005-0137-4     Document Type: Conference Paper

References (17)

1. Adamic, L., Adar, R.: How To Search a Social Network. Technical Report, HP Labs, Palo Alto (2003)
2. Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: 21st ACM Symposium on Principles of Distributed Computing (PODC), pp. 223-232 (2002)
3. Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. In: 15th International Symposium on Distributed Computing (DISC). LNCS 2180, pp. 270-284. Springer-Verlag, Berlin Heidelberg. New York (2001)
4. Coppersmith, D., Gamamik, D., Sviridenko, M.: The diameter of a long-range percolation graph. Random Struct. Algorithms 21(1), 1-13 (2002)
5. Dodds, P., Muhamad, R., Watts, D.: An experimental study of search in global social networks. Science 301, 827-829 (2003)
6. Killworth, P., Bernard, H.: Reverse small-world experiment. Soc. Networks 1(2), 159-192 (1978)
7. Kleinberg, J.: The small-world phenomenon : an algorithmic perspective. In: 32nd ACM Symposium on Theory of Computing (STOC), pp. 163-170 (2000)
8. Kleinberg, J.: Navigation in a small-world. Nature 406, 845 (2000)
9. Kleinberg, J.: Small-world phenomena and the dynamics of information. In: 15th Neural Information Processing Systems (NIPS) (2001)
10. Lebhar, E., Schabanel, N.: Searching for optimal paths in long-range contact networks. In: 31st International Colloquium on Automata, Languages and Programming (ICALP). LNCS 3142, pp. 894-905 (2004)
11. Manku, G., Bawa, M., Raghavan, P.: Symphony: distributed hashing in a small world. In: 4th USENIX Symposium on Internet Technologies and Systems, pp. 127-140 (2003)
12. Manku, G., Naor, M., Wieder, U.: Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. In: 36th ACM Symposium on Theory of Computing (STOC) (2004)
13. Martel, C., Nguyen, V.: Analyzing Kleinberg's (and other) small-world models. In: 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 179-188 (2004)
14. Milgram, S.: The small-world problem. Psychol. Today, pp. 60-67 (1967)
15. Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 32, 425 (1969)
16. Watts, D., Dodds, P., Newman, M.: Identity and search in social networks. Science 296, 1302-1305 (2002)
17. Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440-442 (1998)