Catster households

Metadata

CodePCh
Internal namepetster-cat-household
NameCatster 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 =105,138
Volume m =494,858
Loop count l =0
Wedge count s =1,805,021,303
Claw count z =18,364,455,897,295
Cross count x =162,772,677,444,775,328
Triangle count t =2,305,753
Square count q =1,295,382,806
4-Tour count T4 =17,584,137,376
Maximum degree dmax =37,346
Average degree d =9.413 49
Fill p =0.000 208 753
Size of LCC N =68,315
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.101 03
90-Percentile effective diameter δ0.9 =2.926 02
Median distance δM =3
Mean distance δm =2.616 64
Gini coefficient G =0.729 337
Balanced inequality ratio P =0.222 243
Relative edge distribution entropy Her =0.815 099
Power law exponent γ =1.617 67
Tail power law exponent γt =2.271 00
Tail power law exponent with p γ3 =2.271 00
p-value p =0.000 00
Degree assortativity ρ =−0.133 905
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.003 832 23
Spectral norm α =308.337
Algebraic connectivity a =0.083 453 2
Spectral separation 1[A] / λ2[A]| =1.101 46
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 440 85
Controllability C =32,026
Relative controllability Cr =0.465 116

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

Zipf plot

Hop distribution

Double Laplacian graph drawing

Delaunay 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 ]