Wikibooks edits (ja)

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


Internal nameedit-jawikibooks
NameWikibooks edits (ja)
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 =21,611
Left size n1 =2,163
Right size n2 =19,448
Volume m =72,250
Unique edge count m̿ =32,144
Wedge count s =12,293,199
Claw count z =6,192,623,378
Cross count x =2,707,221,753,771
Square count q =1,232,988
4-Tour count T4 =59,105,004
Maximum degree dmax =8,463
Maximum left degree d1max =8,463
Maximum right degree d2max =985
Average degree d =6.686 41
Average left degree d1 =33.402 7
Average right degree d2 =3.715 03
Fill p =0.000 764 132
Average edge multiplicity m̃ =2.247 70
Size of LCC N =18,374
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.728 51
90-Percentile effective diameter δ0.9 =5.597 06
Median distance δM =4
Mean distance δm =4.421 29
Gini coefficient G =0.780 311
Balanced inequality ratio P =0.185 765
Left balanced inequality ratio P1 =0.106 007
Right balanced inequality ratio P2 =0.264 457
Relative edge distribution entropy Her =0.800 372
Power law exponent γ =3.212 86
Tail power law exponent γt =2.611 00
Tail power law exponent with p γ3 =2.611 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.761 00
Left p-value p1 =0.197 000
Right tail power law exponent with p γ3,2 =2.941 00
Right p-value p2 =0.108 000
Degree assortativity ρ =−0.191 208
Degree assortativity p-value pρ =2.571 64 × 10−262
Spectral norm α =900.976
Algebraic connectivity a =0.022 894 0
Spectral separation 1[A] / λ2[A]| =2.233 38
Controllability C =15,635
Relative controllability Cr =0.811 828


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.