Catster/dogster households

Metadata

CodePKh
Internal namepetster-catdog-household
NameCatster/dogster households
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 =333,111
Volume m =2,643,012
Loop count l =0
Wedge count s =3,632,371,922
Claw count z =23,388,679,165,241
Cross count x =180,335,774,876,015,904
Triangle count t =8,473,307
Square count q =2,326,862,660
4-Tour count T4 =33,149,674,992
Maximum degree dmax =37,346
Average degree d =15.868 7
Fill p =5.006 51 × 10−5
Size of LCC N =324,249
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.148 82
90-Percentile effective diameter δ0.9 =4.855 40
Median distance δM =4
Mean distance δm =3.848 92
Gini coefficient G =0.725 897
Balanced inequality ratio P =0.222 510
Relative edge distribution entropy Her =0.867 427
Power law exponent γ =1.575 53
Tail power law exponent γt =2.251 00
Degree assortativity ρ =−0.071 151 3
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.006 998 16
Spectral norm α =308.337
Spectral separation 1[A] / λ2[A]| =1.062 47
Non-bipartivity bA =0.092 113 5
Normalized non-bipartivity bN =0.048 055 4
Algebraic non-bipartivity χ =0.083 447 8
Spectral bipartite frustration bK =0.001 279 87
Controllability C =113,063
Relative controllability Cr =0.347 955

Plots

Fruchterman–Reingold graph drawing

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

Hop distribution

Double Laplacian graph drawing

Clustering coefficient distribution

Average neighbor degree distribution

SynGraphy

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 ]