Navigating networks by using homophily and degree

Proceedings of the National Academy of Sciences of the United States of America

Volumn 105, Issue 35, 2008, Pages 12758-12762

  Şimşek, Özgür ^a   Jensen, David ^a  

^a University of Massachusetts Amherst   (United States)

Author keywords

Complex networks; Search algorithms; Social network analysis

Indexed keywords

ARTICLE; PRIORITY JOURNAL; PROBABILITY; SOCIAL NETWORK;

EID: 51349127830     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.0800497105     Document Type: Article

References (9)

1. Travers J, Milgram S (1969) An experimental study of the small world problem. Sociometry 32:425-443.
2. Dodds PS, Muhamad R, Watts DJ (2003) An experimental study of search in global social networks. Science 301:827-829.
3. Kleinberg J (2000) The small-world phenomenon: An algorithmic perspective. Proceedings of the 32nd ACM Symposium on Theory of Computing (ACM Press, New York), pp 163-170.
4. Kleinberg J (2000) Navigation in a small world. Nature 406:845.
5. Kleinberg J (2001) Small-world phenomena and the dynamics of information. Adv Neural Info Processing Syst 14:163-170.
6. Watts DJ, Dodds PS, Newman MEJ (2002) Identity and search in social networks. Science 296:1302.
7. Adamic LA, Lukose RM, Puniyani AR, Huberman BA (2001) Search in power-law networks. Phys Rev E 64:046135.
8. Baeza-Yates R, Ribeiro-Neto B (1999) Modern Information Retrieval (Addison - Wesley, Reading, MA).
9. Killworth P, Bernard H (1978) The reversal small-world experiment. Social Networks 1:159-192.