Wikibooks edits (ug)

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

Metadata

Codebug
Internal nameedit-ugwikibooks
NameWikibooks edits (ug)
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 =107
Left size n1 =25
Right size n2 =82
Volume m =150
Unique edge count m̿ =118
Wedge count s =649
Claw count z =3,481
Cross count x =16,316
Square count q =197
4-Tour count T4 =4,440
Maximum degree dmax =43
Maximum left degree d1max =43
Maximum right degree d2max =8
Average degree d =2.803 74
Average left degree d1 =6.000 00
Average right degree d2 =1.829 27
Fill p =0.057 561 0
Average edge multiplicity m̃ =1.271 19
Size of LCC N =61
Diameter δ =12
50-Percentile effective diameter δ0.5 =5.108 55
90-Percentile effective diameter δ0.9 =8.087 14
Median distance δM =6
Mean distance δm =5.389 40
Gini coefficient G =0.499 268
Balanced inequality ratio P =0.323 333
Left balanced inequality ratio P1 =0.293 333
Right balanced inequality ratio P2 =0.373 333
Relative edge distribution entropy Her =0.905 045
Power law exponent γ =3.014 21
Tail power law exponent γt =2.831 00
Degree assortativity ρ =+0.103 468
Degree assortativity p-value pρ =0.264 857
Spectral norm α =10.146 4
Algebraic connectivity a =0.037 848 7
Controllability C =55
Relative controllability Cr =0.523 810

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.