Wikibooks edits (wa)

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

Metadata

Codebwa
Internal nameedit-wawikibooks
NameWikibooks edits (wa)
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 =171
Left size n1 =42
Right size n2 =129
Volume m =187
Unique edge count m̿ =137
Wedge count s =1,244
Claw count z =16,533
Cross count x =178,952
Square count q =4
4-Tour count T4 =5,282
Maximum degree dmax =55
Maximum left degree d1max =55
Maximum right degree d2max =42
Average degree d =2.187 13
Average left degree d1 =4.452 38
Average right degree d2 =1.449 61
Fill p =0.025 286 1
Average edge multiplicity m̃ =1.364 96
Size of LCC N =55
Diameter δ =5
50-Percentile effective diameter δ0.5 =1.615 99
90-Percentile effective diameter δ0.9 =2.668 13
Median distance δM =2
Mean distance δm =2.196 19
Gini coefficient G =0.573 022
Balanced inequality ratio P =0.278 075
Left balanced inequality ratio P1 =0.235 294
Right balanced inequality ratio P2 =0.395 722
Relative edge distribution entropy Her =0.884 092
Power law exponent γ =6.084 38
Tail power law exponent γt =2.831 00
Degree assortativity ρ =−0.155 023
Degree assortativity p-value pρ =0.070 478 5
Spectral norm α =42.201 9
Algebraic connectivity a =0.137 589
Controllability C =83
Relative controllability Cr =0.497 006

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.