Wikibooks edits (ast)

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


Internal nameedit-astwikibooks
NameWikibooks edits (ast)
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 =362
Left size n1 =86
Right size n2 =276
Volume m =447
Unique edge count m̿ =313
Wedge count s =5,477
Claw count z =162,992
Cross count x =3,923,840
Square count q =57
4-Tour count T4 =23,050
Maximum degree dmax =108
Maximum left degree d1max =108
Maximum right degree d2max =47
Average degree d =2.469 61
Average left degree d1 =5.197 67
Average right degree d2 =1.619 57
Fill p =0.013 186 7
Average edge multiplicity m̃ =1.428 12
Size of LCC N =120
Diameter δ =7
50-Percentile effective diameter δ0.5 =1.672 53
90-Percentile effective diameter δ0.9 =3.603 41
Median distance δM =2
Mean distance δm =2.485 76
Gini coefficient G =0.594 308
Balanced inequality ratio P =0.270 694
Left balanced inequality ratio P1 =0.225 951
Right balanced inequality ratio P2 =0.375 839
Relative edge distribution entropy Her =0.876 071
Power law exponent γ =5.549 35
Tail power law exponent γt =2.731 00
Tail power law exponent with p γ3 =2.731 00
p-value p =0.159 000
Left tail power law exponent with p γ3,1 =2.171 00
Left p-value p1 =0.415 000
Right tail power law exponent with p γ3,2 =3.541 00
Right p-value p2 =0.007 000 00
Degree assortativity ρ =−0.203 340
Degree assortativity p-value pρ =0.000 293 522
Spectral norm α =47.212 3
Algebraic connectivity a =0.124 970
Spectral separation 1[A] / λ2[A]| =2.804 23
Controllability C =186
Relative controllability Cr =0.519 553


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.