Wikipedia edits (zh-classical)

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

Metadata

Codezh-classical
Internal nameedit-zh_classicalwiki
NameWikipedia edits (zh-classical)
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 =74,548
Left size n1 =2,704
Right size n2 =71,844
Volume m =249,971
Unique edge count m̿ =131,646
Wedge count s =1,244,193,184
Claw count z =18,643,679,053,166
Cross count x =222,535,717,042,248,032
Square count q =88,760,936
4-Tour count T4 =5,687,165,388
Maximum degree dmax =48,096
Maximum left degree d1max =48,096
Maximum right degree d2max =3,815
Average degree d =6.706 31
Average left degree d1 =92.444 9
Average right degree d2 =3.479 36
Fill p =0.000 677 658
Average edge multiplicity m̃ =1.898 81
Size of LCC N =72,979
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.068 00
90-Percentile effective diameter δ0.9 =3.888 27
Median distance δM =4
Mean distance δm =3.165 26
Gini coefficient G =0.830 501
Balanced inequality ratio P =0.141 126
Left balanced inequality ratio P1 =0.061 827 2
Right balanced inequality ratio P2 =0.221 494
Relative edge distribution entropy Her =0.695 753
Power law exponent γ =4.834 68
Tail power law exponent γt =2.581 00
Degree assortativity ρ =−0.414 471
Degree assortativity p-value pρ =0.000 00
Spectral norm α =3,838.53
Algebraic connectivity a =0.044 064 7

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

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.