Wikibooks edits (xh)

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


Internal nameedit-xhwikibooks
NameWikibooks edits (xh)
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 =167
Left size n1 =37
Right size n2 =130
Volume m =202
Unique edge count m̿ =142
Wedge count s =1,281
Claw count z =16,607
Cross count x =179,037
Square count q =18
4-Tour count T4 =5,564
Maximum degree dmax =55
Maximum left degree d1max =55
Maximum right degree d2max =42
Average degree d =2.419 16
Average left degree d1 =5.459 46
Average right degree d2 =1.553 85
Fill p =0.029 521 8
Average edge multiplicity m̃ =1.422 54
Size of LCC N =49
Diameter δ =3
50-Percentile effective diameter δ0.5 =1.478 88
90-Percentile effective diameter δ0.9 =1.912 51
Median distance δM =2
Mean distance δm =1.942 13
Gini coefficient G =0.587 996
Balanced inequality ratio P =0.269 802
Left balanced inequality ratio P1 =0.242 574
Right balanced inequality ratio P2 =0.386 139
Relative edge distribution entropy Her =0.882 451
Power law exponent γ =5.535 63
Tail power law exponent γt =2.731 00
Tail power law exponent with p γ3 =2.731 00
p-value p =0.173 000
Left tail power law exponent with p γ3,1 =2.171 00
Left p-value p1 =0.774 000
Right tail power law exponent with p γ3,2 =3.891 00
Right p-value p2 =0.036 000 0
Degree assortativity ρ =−0.279 293
Degree assortativity p-value pρ =0.000 762 725
Controllability C =92
Relative controllability Cr =0.554 217


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 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.