Wiktionary edits (za)

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

Metadata

Codemza
Internal nameedit-zawiktionary
NameWiktionary edits (za)
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 =682
Left size n1 =122
Right size n2 =560
Volume m =1,607
Unique edge count m̿ =1,080
Wedge count s =36,444
Claw count z =1,228,946
Cross count x =36,412,869
Square count q =16,584
4-Tour count T4 =280,744
Maximum degree dmax =197
Maximum left degree d1max =197
Maximum right degree d2max =38
Average degree d =4.712 61
Average left degree d1 =13.172 1
Average right degree d2 =2.869 64
Fill p =0.015 808 0
Average edge multiplicity m̃ =1.487 96
Size of LCC N =491
Diameter δ =15
50-Percentile effective diameter δ0.5 =4.912 99
90-Percentile effective diameter δ0.9 =7.803 64
Median distance δM =5
Mean distance δm =5.165 94
Gini coefficient G =0.672 938
Relative edge distribution entropy Her =0.835 158
Power law exponent γ =2.850 15
Tail power law exponent γt =2.031 00
Tail power law exponent with p γ3 =2.031 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.701 00
Left p-value p1 =0.837 000
Right tail power law exponent with p γ3,2 =2.171 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.020 469 9
Degree assortativity p-value pρ =0.501 584
Spectral norm α =38.223 0
Algebraic connectivity a =0.012 782 7

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.