If you publish results based on this graph, please quote the references suggested in the dataset page.

This graph is part of a series that has been studied in the “Four degrees of separation” paper by Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander and Sebastiano Vigna. The series sections the Facebook graph geographically and temporally: please see the paper for the details. Note that years up to 2011 are timed at the first of January, but the “current” graphs are timed at May 2011. In particular, the latest whole Facebook graph prompted the title of the paper.

We cannot distribute the graphs for obvious reasons, but you can download aggregated data (WebGraph properties, HyperANF runs and some degree distributions). If you publish results based on our data, please acknowledge our work by quoting the “Four degrees of separation” paper.

Basic data
nodes721 100 043
arcs137 325 050 412
bits/link12.298 (52.79%)
average degree190.438
average distance4.74 (± 0.021)
reachable pairs100.00% (± 3.110)
median distance5 (92.72%)
harmonic diameter4.59 (± 0.130)
Random access (recommended)
Natural order (random access)
Degree-frequency plotDegree-frequency plot (with Fibonacci binning)
Degree-rank plot (cumulative)Degree-rank plot (cumulative)
Distance probability mass functiondistance probability mass function
Distribution of the logarithm of successor gapsDistribution of the logarithm of the successor gaps
Distribution of successor gapsDistribution of successor gaps