Wikibooks edits (fr)

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


Internal nameedit-frwikibooks
NameWikibooks edits (fr)
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 =58,395
Left size n1 =10,072
Right size n2 =48,323
Volume m =409,932
Unique edge count m̿ =139,212
Wedge count s =268,744,416
Claw count z =794,487,756,016
Cross count x =2,051,696,633,699,377
Square count q =42,197,393
4-Tour count T4 =1,412,944,632
Maximum degree dmax =64,915
Maximum left degree d1max =64,915
Maximum right degree d2max =2,641
Average degree d =14.040 0
Average left degree d1 =40.700 2
Average right degree d2 =8.483 17
Fill p =0.000 286 027
Average edge multiplicity m̃ =2.944 66
Size of LCC N =56,884
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.431 63
90-Percentile effective diameter δ0.9 =4.570 84
Median distance δM =4
Mean distance δm =3.829 50
Gini coefficient G =0.837 187
Balanced inequality ratio P =0.157 261
Left balanced inequality ratio P1 =0.088 619 6
Right balanced inequality ratio P2 =0.208 808
Relative edge distribution entropy Her =0.777 066
Power law exponent γ =2.568 05
Tail power law exponent γt =2.301 00
Degree assortativity ρ =−0.219 842
Degree assortativity p-value pρ =0.000 00
Spectral norm α =4,409.38
Algebraic connectivity a =0.009 431 85
Spectral separation 1[A] / λ2[A]| =2.773 25
Controllability C =25,328
Relative controllability Cr =0.827 280


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

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal distribution

Temporal hop distribution

Diameter/density evolution

Inter-event distribution

Node-level inter-event distribution

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.