Wikibooks edits (gl)

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


Internal nameedit-glwikibooks
NameWikibooks edits (gl)
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 =3,466
Left size n1 =286
Right size n2 =3,180
Volume m =13,382
Unique edge count m̿ =6,093
Wedge count s =1,956,916
Claw count z =622,561,828
Cross count x =162,460,701,603
Square count q =340,512
4-Tour count T4 =10,568,526
Maximum degree dmax =4,440
Maximum left degree d1max =4,440
Maximum right degree d2max =249
Average degree d =7.721 87
Average left degree d1 =46.790 2
Average right degree d2 =4.208 18
Fill p =0.006 699 43
Average edge multiplicity m̃ =2.196 29
Size of LCC N =3,268
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.292 33
90-Percentile effective diameter δ0.9 =5.386 63
Median distance δM =4
Mean distance δm =3.697 92
Gini coefficient G =0.742 735
Balanced inequality ratio P =0.213 944
Left balanced inequality ratio P1 =0.074 503 1
Right balanced inequality ratio P2 =0.306 382
Relative edge distribution entropy Her =0.754 583
Power law exponent γ =2.835 74
Tail power law exponent γt =3.321 00
Tail power law exponent with p γ3 =3.321 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.731 00
Left p-value p1 =0.460 000
Right tail power law exponent with p γ3,2 =3.821 00
Right p-value p2 =0.055 000 0
Degree assortativity ρ =−0.244 023
Degree assortativity p-value pρ =2.623 99 × 10−83
Spectral norm α =349.864
Algebraic connectivity a =0.017 843 7
Spectral separation 1[A] / λ2[A]| =3.087 90
Controllability C =2,964
Relative controllability Cr =0.857 143


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.