Wikipedia edits (zh-min-nan)

This is the bipartite edit network of the Chinese (Min Nan) Wikipedia. It contains users and pages from the Chinese (Min Nan) Wikipedia, connected by edit events. Each edge represents an edit. The dataset includes the timestamp of each edit.

Metadata

Codezh-min-nan
Internal nameedit-zh_min_nanwiki
NameWikipedia edits (zh-min-nan)
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 =660,825
Left size n1 =2,326
Right size n2 =658,499
Volume m =1,731,598
Unique edge count m̿ =957,313
Wedge count s =187,650,418,254
Claw count z =35,934,107,834,734,540
Cross count x =5.324 28 × 1021
Square count q =8,547,172,381
4-Tour count T4 =818,981,132,834
Maximum degree dmax =969,316
Maximum left degree d1max =969,316
Maximum right degree d2max =759
Average degree d =5.240 72
Average left degree d1 =744.453
Average right degree d2 =2.629 61
Fill p =0.000 625 013
Average edge multiplicity m̃ =1.808 81
Size of LCC N =655,575
Diameter δ =13
50-Percentile effective diameter δ0.5 =1.655 18
90-Percentile effective diameter δ0.9 =3.675 25
Median distance δM =2
Mean distance δm =2.509 86
Gini coefficient G =0.768 571
Balanced inequality ratio P =0.184 459
Left balanced inequality ratio P1 =0.022 245 3
Right balanced inequality ratio P2 =0.285 071
Relative edge distribution entropy Her =0.611 161
Power law exponent γ =6.310 03
Tail power law exponent γt =2.871 00
Degree assortativity ρ =−0.610 752
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,053.18

Plots

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

Edge weight/multiplicity distribution

Temporal 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.