Wikiquote edits (zh)

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

Metadata

Codeqzh
Internal nameedit-zhwikisource
NameWikiquote edits (zh)
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 =569,151
Left size n1 =3,468
Right size n2 =565,683
Volume m =1,042,383
Unique edge count m̿ =732,711
Wedge count s =43,419,292,913
Claw count z =3,224,452,373,961,204
Cross count x =2.032 92 × 1020
Square count q =1,249,136,464
4-Tour count T4 =183,671,751,054
Maximum degree dmax =270,445
Maximum left degree d1max =270,445
Maximum right degree d2max =2,399
Average degree d =3.662 94
Average left degree d1 =300.572
Average right degree d2 =1.842 70
Average edge multiplicity m̃ =1.422 64
Size of LCC N =566,655
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.368 27
90-Percentile effective diameter δ0.9 =3.936 11
Median distance δM =4
Mean distance δm =3.606 00
Balanced inequality ratio P =0.235 838
Left balanced inequality ratio P1 =0.038 710 3
Right balanced inequality ratio P2 =0.349 153
Relative edge distribution entropy Her =0.656 814
Power law exponent γ =6.520 38
Tail power law exponent γt =4.021 00
Degree assortativity ρ =−0.151 584
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,017.31
Algebraic connectivity a =0.012 863 8
Controllability C =561,448
Relative controllability Cr =0.988 928

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

Double Laplacian graph drawing

Delaunay graph drawing

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.