Four degrees of separation

Proceedings of the 4th Annual ACM Web Science Conference, WebSci'12

Volumn volume, Issue , 2012, Pages 33-42

  Backstrom, Lars ^a   Boldi, Paolo ^b   Rosa, Marco ^b   Ugander, Johan ^a   Vigna, Sebastiano ^b  

^a FACEBOOK   (United States)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

METADATA;

AVERAGE DISTANCE; AVERAGE NUMBERS; DISTANCE DISTRIBUTIONS; FACEBOOK; ORDERS OF MAGNITUDE; PROBABILISTIC ALGORITHM; SUBGRAPHS;

SOCIAL NETWORKING (ONLINE);

EID: 84869022876     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2380718.2380723     Document Type: Conference Paper

References (22)

1. Lars Backstrom and Eric Sun and Cameron Marlow Find me if you can: improving geographical prediction with social and spatial proximity. In WWW, 61-70, 2010.
2. Paolo Boldi, Marco Rosa, Massimo Santini, and Sebastiano Vigna. Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks. In WWW, 587-596, 2011.
3. Paolo Boldi, Marco Rosa, and Sebastiano Vigna. HyperANF: Approximating the neighbourhood function of very large graphs on a budget. In WWW, 625-634, 2011.
4. Paolo Boldi and Sebastiano Vigna. The WebGraph framework I: Compression techniques. In WWW, 595-601, 2004.
5. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., and Wiener, J. Graph structure in the Web: experiments and models. Computer Networks 33, 1-6 (2000), 309-320.
6. Crescenzi, P., Grossi, R., Habib, M., Lanzi, L., and Marino, A. On Computing the Diameter of Real-World Undirected Graphs. Submitted to the special issue of Theoretical Computer Science in honor of Giorgio Ausiello in the occasion of his 70th birthday., 2011.
7. Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi,and Andrea Marino. A comparison of three algorithms for approximating the distance distribution in real-world graphs. In TAPAS, 92-103, 2011.
8. Bradley Efron and Gail Gong. A leisurely look at the bootstrap, the jackknife, and cross-validation. The American Statistician, 37(1):36-48, 1983.
9. Philippe Flajolet, Éric Fusy, Olivier Gandouet, and Frédéric Meunier. HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. In AofA 07, 127-146, 2007.
10. Sharad Goel, Roby Muhamad, and Duncan Watts. Social search in "small-world" experiments. In WWW, 701-710, 2009.
11. Michael Gurevitch. The social structure of acquaintanceship networks. PhD thesis, Massachusetts Institute of Technology, Dept. of Economics, 1961.
12. Jon M. Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC, 163-170, 2000.
13. Silvio Lattanzi, Alessandro Panconesi, and D. Sivakumar. Milgram-routing in social networks. In WWW, 725-734, 2011.
14. Jure Leskovec and Eric Horvitz. Planetary-scale views on a large instant-messaging network. In WWW, 915-924, 2008.
15. Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. Graph evolution: Densification and shrinking diameters. ACM TKDD, 1(1), 2007.
16. Lun Li, David L. Alderson, John Doyle, and Walter Willinger. Towards a theory of scale-free graphs: Definition, properties, and implications. Internet Math., 2(4), 2005.
17. David Liben-Nowell, Jasmine Novak, Ravi Kumar, Prabhakar Raghavan, and Andrew Tomkins. Geographic routing in social networks. Proc Nat Acad Sci USA, 102(33):11623-11628, 2005.
18. Stanley Milgram. The small world problem. Psychology Today, 2(1):60-67, 1967.
19. Christopher R. Palmer, Phillip B. Gibbons, and Christos Faloutsos. Anf: a fast and scalable tool for data mining in massive graphs. In KDD, 81-90, 2002.
20. Anatol Rapoport and William J. Horvath. A study of a large sociogram. Behavorial Science, 6:279-291, 1961.
21. Jeffrey Travers and Stanley Milgram. An experimental study of the small world problem. Sociometry, 32(4):425-443, 1969.
22. Qi Ye, Bin Wu, and Bai Wang. Distance distribution and average shortest path length estimation in real-world networks. In ADMA, 322-333, 2010.