Wikibooks edits (mi)

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

Metadata

Codebmi
Internal nameedit-miwikibooks
NameWikibooks edits (mi)
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 =94
Left size n1 =20
Right size n2 =74
Volume m =155
Unique edge count m̿ =106
Wedge count s =801
Claw count z =5,449
Cross count x =30,482
Square count q =234
4-Tour count T4 =5,316
Maximum degree dmax =49
Maximum left degree d1max =49
Maximum right degree d2max =14
Average degree d =3.297 87
Average left degree d1 =7.750 00
Average right degree d2 =2.094 59
Fill p =0.071 621 6
Average edge multiplicity m̃ =1.462 26
Size of LCC N =54
Diameter δ =8
50-Percentile effective diameter δ0.5 =3.018 57
90-Percentile effective diameter δ0.9 =5.751 78
Median distance δM =4
Mean distance δm =3.659 48
Gini coefficient G =0.560 407
Balanced inequality ratio P =0.300 000
Left balanced inequality ratio P1 =0.212 903
Right balanced inequality ratio P2 =0.367 742
Relative edge distribution entropy Her =0.875 478
Power law exponent γ =3.158 41
Tail power law exponent γt =2.141 00
Tail power law exponent with p γ3 =2.141 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.681 00
Left p-value p1 =0.643 000
Right tail power law exponent with p γ3,2 =6.401 00
Right p-value p2 =0.490 000
Degree assortativity ρ =+0.382 157
Degree assortativity p-value pρ =5.289 62 × 10−5
Spectral norm α =14.969 3
Algebraic connectivity a =0.047 174 8
Spectral separation |λ1[A] / λ2[A]| =1.397 62
Controllability C =54
Relative controllability Cr =0.586 957

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

Inter-event distribution

Node-level inter-event distribution

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.