Catster/dogster friends

Metadata

CodePKf
Internal namepetster-catdog-friend
NameCatster/dogster 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 =623,754
Volume m =13,991,746
Loop count l =0
Wedge count s =68,170,301,408
Claw count z =1,208,622,281,511,354
Cross count x =2.140 81 × 1019
Triangle count t =268,961,593
Square count q =495,934,544,722
4-Tour count T4 =4,240,185,546,900
Maximum degree dmax =80,634
Average degree d =44.863 0
Fill p =8.421 22 × 10−5
Size of LCC N =575,277
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.611 68
90-Percentile effective diameter δ0.9 =4.954 86
Median distance δM =4
Mean distance δm =4.078 73
Gini coefficient G =0.763 827
Balanced inequality ratio P =0.203 847
Relative edge distribution entropy Her =0.856 766
Power law exponent γ =1.380 68
Tail power law exponent γt =2.141 00
Tail power law exponent with p γ3 =2.141 00
p-value p =0.000 00
Degree assortativity ρ =−0.094 881 4
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.011 836 3
Spectral norm α =1,181.28
Spectral separation 1[A] / λ2[A]| =1.155 83
Non-bipartivity bA =0.134 819
Normalized non-bipartivity bN =0.025 052 7
Controllability C =211,022
Relative controllability Cr =0.366 070

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

Zipf plot

Hop distribution

Clustering coefficient 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 ]