Wikibooks edits (zu)

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


Internal nameedit-zuwikibooks
NameWikibooks edits (zu)
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 =271
Left size n1 =64
Right size n2 =207
Volume m =356
Unique edge count m̿ =235
Wedge count s =4,195
Claw count z =114,079
Cross count x =2,442,456
Square count q =25
4-Tour count T4 =17,498
Maximum degree dmax =92
Maximum left degree d1max =92
Maximum right degree d2max =41
Average degree d =2.627 31
Average left degree d1 =5.562 50
Average right degree d2 =1.719 81
Fill p =0.017 738 5
Average edge multiplicity m̃ =1.514 89
Size of LCC N =100
Diameter δ =6
50-Percentile effective diameter δ0.5 =1.535 87
90-Percentile effective diameter δ0.9 =1.994 50
Median distance δM =2
Mean distance δm =2.108 35
Gini coefficient G =0.617 123
Relative edge distribution entropy Her =0.865 412
Power law exponent γ =5.774 48
Tail power law exponent γt =2.781 00
Degree assortativity ρ =−0.252 218
Degree assortativity p-value pρ =9.260 43 × 10−5
Spectral norm α =41.206 8
Algebraic connectivity a =0.059 587 5
Controllability C =149
Relative controllability Cr =0.549 815


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.