Wikibooks edits (my)

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

Metadata

Codebmy
Internal nameedit-mywikibooks
NameWikibooks edits (my)
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 =98
Left size n1 =25
Right size n2 =73
Volume m =123
Unique edge count m̿ =87
Wedge count s =327
Claw count z =1,484
Cross count x =6,144
Square count q =7
4-Tour count T4 =1,578
Maximum degree dmax =22
Maximum left degree d1max =22
Maximum right degree d2max =22
Average degree d =2.510 20
Average left degree d1 =4.920 00
Average right degree d2 =1.684 93
Fill p =0.047 671 2
Average edge multiplicity m̃ =1.413 79
Size of LCC N =48
Diameter δ =8
50-Percentile effective diameter δ0.5 =3.054 21
90-Percentile effective diameter δ0.9 =4.780 67
Median distance δM =4
Mean distance δm =3.414 73
Gini coefficient G =0.558 303
Balanced inequality ratio P =0.276 423
Left balanced inequality ratio P1 =0.292 683
Right balanced inequality ratio P2 =0.365 854
Relative edge distribution entropy Her =0.915 019
Power law exponent γ =4.145 67
Tail power law exponent γt =2.421 00
Tail power law exponent with p γ3 =2.421 00
p-value p =0.792 000
Left tail power law exponent with p γ3,1 =2.921 00
Left p-value p1 =0.367 000
Right tail power law exponent with p γ3,2 =3.441 00
Right p-value p2 =0.197 000
Degree assortativity ρ =−0.113 753
Degree assortativity p-value pρ =0.294 139
Spectral norm α =13.583 3
Algebraic connectivity a =0.066 938 0
Spectral separation 1[A] / λ2[A]| =1.879 80
Controllability C =47
Relative controllability Cr =0.484 536

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.