Wikibooks edits (uz)

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

Metadata

Codebuz
Internal nameedit-uzwikibooks
NameWikibooks edits (uz)
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 =500
Left size n1 =102
Right size n2 =398
Volume m =565
Unique edge count m̿ =440
Wedge count s =13,796
Claw count z =697,423
Cross count x =27,651,060
Square count q =37
4-Tour count T4 =56,420
Maximum degree dmax =177
Maximum left degree d1max =177
Maximum right degree d2max =42
Average degree d =2.260 00
Average left degree d1 =5.539 22
Average right degree d2 =1.419 60
Fill p =0.010 838 5
Average edge multiplicity m̃ =1.284 09
Size of LCC N =216
Diameter δ =8
50-Percentile effective diameter δ0.5 =1.828 96
90-Percentile effective diameter δ0.9 =3.914 44
Median distance δM =2
Mean distance δm =2.843 74
Gini coefficient G =0.567 268
Balanced inequality ratio P =0.279 646
Left balanced inequality ratio P1 =0.231 858
Right balanced inequality ratio P2 =0.405 310
Relative edge distribution entropy Her =0.855 276
Power law exponent γ =5.913 87
Tail power law exponent γt =2.801 00
Tail power law exponent with p γ3 =2.801 00
p-value p =0.071 000 0
Left tail power law exponent with p γ3,1 =2.131 00
Left p-value p1 =0.221 000
Right tail power law exponent with p γ3,2 =3.781 00
Right p-value p2 =0.298 000
Degree assortativity ρ =−0.189 664
Degree assortativity p-value pρ =6.241 21 × 10−5
Algebraic connectivity a =0.044 769 9

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.