Dogster friends

Metadata

CodePDf
Internal namepetster-dog-friend
NameDogster friends
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Online social network
Network formatUnipartite, undirected
Edge typeUnweighted, no multiple edges
LoopsDoes not contain loops

Statistics

Size n =451,710
Volume m =8,543,549
Loop count l =0
Wedge count s =17,554,438,218
Claw count z =123,909,192,897,457
Cross count x =1,142,622,546,298,770,944
Triangle count t =83,499,364
Square count q =68,359,711,169
4-Tour count T4 =617,112,529,322
Maximum degree dmax =46,503
Average degree d =37.827 6
Fill p =9.379 68 × 10−5
Size of LCC N =426,485
Diameter δ =11
50-Percentile effective diameter δ0.5 =2.797 68
90-Percentile effective diameter δ0.9 =3.856 06
Median distance δM =3
Mean distance δm =3.388 00
Gini coefficient G =0.750 630
Balanced inequality ratio P =0.209 928
Relative edge distribution entropy Her =0.866 796
Power law exponent γ =1.399 74
Tail power law exponent γt =2.151 00
Degree assortativity ρ =−0.088 425 6
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.014 269 8
Spectral norm α =742.380
Non-bipartivity bA =0.351 696
Normalized non-bipartivity bN =0.040 102 7
Spectral bipartite frustration bK =0.000 638 889
Controllability C =140,871
Relative controllability Cr =0.330 051

Plots

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 normalized adjacency matrix

Degree assortativity

Hop distribution

Clustering coefficient distribution

Average neighbor degree distribution

Matrix decompositions plots

Downloads

References

[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]