[1] J Travers and S Milgram. An experimental study of the small world problem. Sociometry, 32(4):425-443, 1969. [ bib ]
[2] R Muhamad and Duncan Watts. An experimental study of search in global social networks. Science, Jan 2003. [ bib | http ]
We report on a global social - search experiment in which more than 60,000 e-mail users attempted to reach one of 18 target persons in 13 countries by forwarding messages to acquaintances. We find that successful social search is conducted primarily through intermediate to weak ...

[3] S Milgram. The small world problem. Psychology today, Jan 1967. [ bib | .pdf ]
Yjew holds that any two people in the , no matter how remote from each other, can be linked in terms of inter mediate acquaintances, and that the number oí such intermediate links is relatively . This view sees ac- guafatances in terms or an infinitely intersecting arrangement

[4] Duncan Watts, PS Dodds, and MEJ Newman. Identity and search in social networks. Science, 296(5571):1302, 2002. [ bib ]
[5] Jon Kleinberg. The small-world phenomenon: an algorithm perspective. STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, May 2000. [ bib | http ]
[6] Lada A Adamic.... How to search a social network. Social Networks, Jan 2005. [ bib | http ]
We address the question of how participants in a small world experiment are able to find short paths in a social network using only local information about their immediate contacts. We simulate such experiments on a network of actual email contacts within an organization as well as ...

[7] Jon Kleinberg. Small-world phenomena and the dynamics of information. Advances in Neural Information Processing Systems (NIPS), 14, Jan 2001. [ bib | http ]
- and the of Jon Department of Computer Science Cornell University Ithaca NY 14853 1 Introduction The problem of searching for in networks like the World Wide Web can be approached in a variety of ways, ranging

[8] Jon Kleinberg. Navigation in a small world. Nature, Jan 2000. [ bib | .html ]
The - phenomenon - the principle that most of us are linked by short chains of acquaintances - was first investigated as a question in sociology 1, 2 and is a feature of a range of networks arising in nature and technology 3, 4, 5 . Experimental study of the phenomenon 1

[9] S Schnettler. A structured overview of 50 years of small-world research. Social Networks, Jan 2009. [ bib | http ]
This paper offers a structured overview of 50 years of small - world research . Initially formulated by Pool and Kochen in the mid-1950s, the small-world concept can be divided into six research foci, based on three dimensions (structural, process-related, psychological), and two ...

[10] F Menczer. Growing and navigating the small world web by local content. Proceedings of the National Academy of ..., Jan 2002. [ bib | http ]
Can we model the scale-free distribution of Web hypertext degree under realistic assumptions about the behavior of page authors? Can a Web crawler efficiently locate an unknown relevant page? These questions are receiving much attention due to their potential impact for ...

[11] P Fraigniaud. Small worlds as navigable augmented networks: Model, analysis, and validation. Algorithms-ESA 2007, pages 2-11, 2007. [ bib ]
[12] D Liben-Nowell, J Novak, R Kumar, P Raghavan, and A Tomkins. Geographic routing in social networks. Proceedings of the National Academy of Sciences of the United States of America, 102(33):11623, 2005. [ bib ]
[13] H Bernard, P Killworth, and C McCarty.... The reverse small world experiment ii. oai.dtic.mil, Jan 1979. [ bib | http ]
Accession Number : ADA074847. Title : The Reverse Small World Experiment II. Descriptive Note : Interim rept.,. Corporate Author : WEST VIRGINIA UNIV MORGANTOWN. Personal Author(s) : Bernard,H. Russell ; Killworth,Peter D. ; McCarty,Christopher. ...

[14] Gurmeet Manku, Moni Naor, and Udi Wieder. Know thy neighbor's neighbor: the power of lookahead in randomized p2p networks. STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, Jun 2004. [ bib | http ]
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e. g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world percolation networks. In each ...

Keywords: random structures, peer to peer networks, greedy routing
[15] M Granovetter. The strength of weak ties: A network theory revisited. Sociological theory, Dec 1983. [ bib | http ]
In this chapter I review empirical studies directly testing the hypotheses of my 1973 paper "The Strength of Weak Ties" (hereafter "SWT") and work that elaborates those hypotheses theoretically or uses them to suggest new empirical research not discussed in my original formulation.

[16] Duncan Watts and S Strogatz. Collective dynamics of 'small-world'networks. Nature, Dec 1998. [ bib | .html ]
An animal model is required which allows replication of JC virus. The Seeker requires a theoretical ... The Seeker is looking for an individual, laboratory or other organization that would be able to prov... Present address: Paul F. Lazarsfeld Center for the Social Sciences,

[17] J Kleinfeld. Could it be a big world after all? the “six degrees of separation” myth. Society, Jan 2002. [ bib | .pdf ]
The idea that people are connected through just "six degrees of separation," based on Stanley Milgram's "small world study," has become part of the intellectual furniture of educated people. New evidence discovered in the Milgram papers in the Yale archives, together ...

This file was generated by bibtex2html 1.91.