Catster friends

Metadata

CodePCf
Internal namepetster-cat-friend
NameCatster 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 =204,473
Volume m =5,448,197
Loop count l =0
Wedge count s =50,615,774,277
Claw count z =1,084,712,871,297,358
Cross count x =2.026 55 × 1019
Triangle count t =185,462,177
Square count q =427,574,757,984
4-Tour count T4 =3,623,072,057,374
Maximum degree dmax =80,634
Average degree d =53.290 1
Fill p =0.000 486 334
Size of LCC N =148,826
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.236 60
90-Percentile effective diameter δ0.9 =2.988 01
Median distance δM =3
Mean distance δm =2.727 39
Gini coefficient G =0.771 029
Balanced inequality ratio P =0.197 067
Relative edge distribution entropy Her =0.826 425
Power law exponent γ =1.335 18
Tail power law exponent γt =2.121 00
Degree assortativity ρ =−0.164 158
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.010 992 4
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
Algebraic non-bipartivity χ =0.108 273
Spectral bipartite frustration bK =0.000 369 755
Controllability C =70,183
Relative controllability Cr =0.468 874

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

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 ]