This is the social network of Douban, a Chinese online recommendation site. The network is undirected and unweighted.


Internal namedouban
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Online social network
Node meaningUser
Edge meaningFriendship
Network formatUnipartite, undirected
Edge typeUnweighted, no multiple edges
LoopsDoes not contain loops


Size n =154,908
Volume m =327,162
Wedge count s =11,745,116
Claw count z =269,719,710
Cross count x =6,564,312,495
Triangle count t =40,612
Square count q =750,163
4-Tour count T4 =53,636,092
Maximum degree dmax =287
Average degree d =4.223 95
Fill p =2.726 77 × 10−5
Size of LCC N =154,908
Diameter δ =9
50-Percentile effective diameter δ0.5 =4.602 48
90-Percentile effective diameter δ0.9 =5.695 94
Median distance δM =5
Mean distance δm =5.100 46
Gini coefficient G =0.694 496
Relative edge distribution entropy Her =0.889 699
Power law exponent γ =2.970 61
Tail power law exponent γt =2.081 00
Degree assortativity ρ =−0.180 331
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.010 373 3
Spectral norm α =41.968 2
Algebraic connectivity a =0.018 767 2


Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Degree assortativity

Zipf plot

Hop distribution

Clustering coefficient distribution

Average neighbor degree distribution

Matrix decompositions plots



[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]
[2] R. Zafarani and H. Liu. Social computing data repository at ASU, 2009. [ http ]