Wikibooks edits (gn)

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


Internal nameedit-gnwikibooks
NameWikibooks edits (gn)
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 =68
Left size n1 =21
Right size n2 =47
Volume m =62
Unique edge count m̿ =54
Wedge count s =85
Claw count z =97
Cross count x =92
Square count q =4
4-Tour count T4 =484
Maximum degree dmax =8
Maximum left degree d1max =8
Maximum right degree d2max =3
Average degree d =1.823 53
Average left degree d1 =2.952 38
Average right degree d2 =1.319 15
Fill p =0.054 711 2
Average edge multiplicity m̃ =1.148 15
Size of LCC N =10
Diameter δ =4
50-Percentile effective diameter δ0.5 =1.521 74
90-Percentile effective diameter δ0.9 =3.400 00
Median distance δM =2
Mean distance δm =2.092 59
Gini coefficient G =0.396 019
Balanced inequality ratio P =0.338 710
Left balanced inequality ratio P1 =0.338 710
Right balanced inequality ratio P2 =0.419 355
Relative edge distribution entropy Her =0.949 346
Power law exponent γ =4.422 79
Tail power law exponent γt =2.491 00
Tail power law exponent with p γ3 =2.491 00
p-value p =0.282 000
Left tail power law exponent with p γ3,1 =3.651 00
Left p-value p1 =0.447 000
Right tail power law exponent with p γ3,2 =3.471 00
Right p-value p2 =0.087 000 0
Degree assortativity ρ =−0.036 578 4
Degree assortativity p-value pρ =0.792 864
Spectral norm α =4.079 14
Spectral separation 1[A] / λ2[A]| =1.289 94
Controllability C =28
Relative controllability Cr =0.411 765


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 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

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.