Wikibooks edits (kk)

This is the bipartite edit network of the Kazakh Wikibooks. It contains users and pages from the Kazakh Wikibooks, connected by edit events. Each edge represents an edit. The dataset includes the timestamp of each edit.

Metadata

Codebkk
Internal nameedit-kkwikibooks
NameWikibooks edits (kk)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Authorship network
Dataset timestamp 2017-10-20
Node meaningUser, article
Edge meaningEdit
Network formatBipartite, undirected
Edge typeUnweighted, multiple edges
Temporal data Edges are annotated with timestamps

Statistics

Size n =1,162
Left size n1 =169
Right size n2 =993
Volume m =2,101
Unique edge count m̿ =1,213
Wedge count s =41,357
Claw count z =1,868,701
Cross count x =75,131,262
Square count q =1,346
4-Tour count T4 =178,946
Maximum degree dmax =405
Maximum left degree d1max =405
Maximum right degree d2max =129
Average degree d =3.616 18
Average left degree d1 =12.432 0
Average right degree d2 =2.115 81
Fill p =0.007 228 11
Average edge multiplicity m̃ =1.732 07
Size of LCC N =820
Diameter δ =12
50-Percentile effective diameter δ0.5 =5.219 27
90-Percentile effective diameter δ0.9 =7.308 14
Median distance δM =6
Mean distance δm =5.248 13
Gini coefficient G =0.669 767
Relative edge distribution entropy Her =0.845 052
Power law exponent γ =4.879 87
Tail power law exponent γt =2.591 00
Tail power law exponent with p γ3 =2.591 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.771 00
Left p-value p1 =0.131 000
Right tail power law exponent with p γ3,2 =4.521 00
Right p-value p2 =0.017 000 0
Degree assortativity ρ =−0.187 196
Degree assortativity p-value pρ =4.992 95 × 10−11
Spectral norm α =89.921 4
Algebraic connectivity a =0.013 913 7

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

Edge weight/multiplicity distribution

Temporal distribution

Temporal hop distribution

Diameter/density evolution

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 ]
[2] Wikimedia Foundation. Wikimedia downloads. http://dumps.wikimedia.org/, January 2010.