Wikibooks edits (uk)

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


Internal nameedit-ukwikibooks
NameWikibooks edits (uk)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
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


Size n =3,229
Left size n1 =452
Right size n2 =2,777
Volume m =14,277
Unique edge count m̿ =4,254
Wedge count s =508,958
Claw count z =95,571,424
Cross count x =16,115,911,017
Square count q =26,372
4-Tour count T4 =2,256,948
Maximum degree dmax =2,927
Maximum left degree d1max =2,927
Maximum right degree d2max =595
Average degree d =8.842 99
Average left degree d1 =31.586 3
Average right degree d2 =5.141 16
Fill p =0.003 389 09
Average edge multiplicity m̃ =3.356 14
Size of LCC N =2,829
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.923 75
90-Percentile effective diameter δ0.9 =5.982 53
Median distance δM =4
Mean distance δm =4.748 46
Gini coefficient G =0.802 768
Balanced inequality ratio P =0.169 994
Left balanced inequality ratio P1 =0.106 955
Right balanced inequality ratio P2 =0.227 569
Relative edge distribution entropy Her =0.816 629
Power law exponent γ =3.858 90
Tail power law exponent γt =2.281 00
Tail power law exponent with p γ3 =2.281 00
p-value p =0.098 000 0
Left tail power law exponent with p γ3,1 =1.791 00
Left p-value p1 =0.393 000
Right tail power law exponent with p γ3,2 =3.251 00
Right p-value p2 =0.015 000 0
Degree assortativity ρ =−0.174 617
Degree assortativity p-value pρ =1.784 86 × 10−30
Spectral norm α =670.680
Algebraic connectivity a =0.007 096 09
Spectral separation 1[A] / λ2[A]| =2.803 10
Controllability C =2,372
Relative controllability Cr =0.742 178


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



[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., January 2010.