The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
ANF: a fast and scalable tool for data mining in massive graphs
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
The webgraph framework I: compression techniques
Proceedings of the 13th international conference on World Wide Web
Graph evolution: Densification and shrinking diameters
ACM Transactions on Knowledge Discovery from Data (TKDD)
Planetary-scale views on a large instant-messaging network
Proceedings of the 17th international conference on World Wide Web
Social search in "Small-World" experiments
Proceedings of the 18th international conference on World wide web
Find me if you can: improving geographical prediction with social and spatial proximity
Proceedings of the 19th international conference on World wide web
Distance distribution and average shortest path length estimation in real-world networks
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Proceedings of the 20th international conference on World wide web
HyperANF: approximating the neighbourhood function of very large graphs on a budget
Proceedings of the 20th international conference on World wide web
Milgram-routing in social networks
Proceedings of the 20th international conference on World wide web
A comparison of three algorithms for approximating the distance distribution in real-world graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Evolution of social-attribute networks: measurements, modeling, and implications using google+
Proceedings of the 2012 ACM conference on Internet measurement conference
Four Degrees of Separation, Really
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
HeartLink: open broadcast of live biometric data to social networks
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
How social network is evolving?: a preliminary study on billion-scale twitter network
Proceedings of the 22nd international conference on World Wide Web companion
The role of research leaders on the evolution of scientific communities
Proceedings of the 22nd international conference on World Wide Web companion
DrunkardMob: billions of random walks on just a PC
Proceedings of the 7th ACM conference on Recommender systems
Buddy2GuessWho: a smartphone application in on-line social network platform
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Hi-index | 0.00 |
Frigyes Karinthy, in his 1929 short story "Láncszemek" (in English, "Chains") suggested that any two persons are distanced by at most six friendship links.1 Stanley Milgram in his famous experiments challenged people to route postcards to a fixed recipient by passing them only through direct acquaintances. Milgram found that the average number of intermediaries on the path of the postcards lay between 4:4 and 5:7, depending on the sample of people chosen. We report the results of the first world-scale social-network graph-distance computations, using the entire Facebook network of active users (≈ 721 million users, ≈ 69 billion friendship links). The average distance we observe is 4:74, corresponding to 3:74 intermediaries or "degrees of separation", prompting the title of this paper. More generally, we study the distance distribution of Facebook and of some interesting geographic subgraphs, looking also at their evolution over time. The networks we are able to explore are almost two orders of magnitude larger than those analysed in the previous literature. We report detailed statistical metadata showing that our measurements (which rely on probabilistic algorithms) are very accurate.