Four Degrees of Separation
Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano, Vigna

TL;DR
This paper presents the first large-scale analysis of the Facebook social network, revealing an average degree of separation of about 3.74, and explores the network's distance distribution and evolution over time.
Contribution
It provides the first comprehensive, large-scale measurement of social distances on Facebook, significantly larger than previous studies, with detailed statistical validation.
Findings
Average degree of separation is approximately 3.74.
Facebook's social network is smaller than previously estimated.
The study analyzes the evolution of social distances over time.
Abstract
Frigyes Karinthy, in his 1929 short story "L\'aancszemek" ("Chains") suggested that any two persons are distanced by at most six friendship links. (The exact wording of the story is slightly ambiguous: "He bet us that, using no more than five individuals, one of whom is a personal acquaintance, he could contact the selected individual [...]". It is not completely clear whether the selected individual is part of the five, so this could actually allude to distance five or six in the language of graph theory, but the "six degrees of separation" phrase stuck after John Guare's 1990 eponymous play. Following Milgram's definition and Guare's interpretation, we will assume that "degrees of separation" is the same as "distance minus one", where "distance" is the usual path length-the number of arcs in the path.) Stanley Milgram in his famous experiment challenged people to route postcards to a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Complex Network Analysis Techniques · Caching and Content Delivery
