Wikibooks edits (got)

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

Metadata

Codebgot
Internal nameedit-gotwikibooks
NameWikibooks edits (got)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
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

Statistics

Size n =90
Left size n1 =25
Right size n2 =65
Volume m =127
Unique edge count m̿ =95
Wedge count s =467
Claw count z =2,069
Cross count x =7,407
Square count q =109
4-Tour count T4 =2,990
Maximum degree dmax =33
Maximum left degree d1max =33
Maximum right degree d2max =5
Average degree d =2.822 22
Average left degree d1 =5.080 00
Average right degree d2 =1.953 85
Fill p =0.058 461 5
Average edge multiplicity m̃ =1.336 84
Size of LCC N =37
Diameter δ =7
50-Percentile effective diameter δ0.5 =2.273 71
90-Percentile effective diameter δ0.9 =4.606 21
Median distance δM =3
Mean distance δm =3.053 63
Gini coefficient G =0.517 505
Balanced inequality ratio P =0.314 961
Left balanced inequality ratio P1 =0.212 598
Right balanced inequality ratio P2 =0.377 953
Relative edge distribution entropy Her =0.900 063
Power law exponent γ =3.292 73
Tail power law exponent γt =2.181 00
Tail power law exponent with p γ3 =2.181 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.821 00
Left p-value p1 =0.213 000
Right tail power law exponent with p γ3,2 =6.121 00
Right p-value p2 =0.477 000
Degree assortativity ρ =+0.301 586
Degree assortativity p-value pρ =0.002 977 35
Spectral norm α =8.855 11
Algebraic connectivity a =0.026 186 2
Spectral separation 1[A] / λ2[A]| =1.241 79
Controllability C =42
Relative controllability Cr =0.466 667

Plots

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

Downloads

References

[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. http://dumps.wikimedia.org/, January 2010.