Wikiquote edits (zh)

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


Internal nameedit-zhwikiquote
NameWikiquote edits (zh)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
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


Size n =11,164
Left size n1 =2,525
Right size n2 =8,639
Volume m =41,991
Unique edge count m̿ =21,950
Wedge count s =5,122,977
Claw count z =1,709,689,566
Cross count x =539,833,942,344
Square count q =1,954,211
4-Tour count T4 =36,174,196
Maximum degree dmax =3,153
Maximum left degree d1max =3,153
Maximum right degree d2max =635
Average degree d =7.522 57
Average left degree d1 =16.630 1
Average right degree d2 =4.860 63
Fill p =0.001 006 26
Average edge multiplicity m̃ =1.913 03
Size of LCC N =10,167
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.769 67
90-Percentile effective diameter δ0.9 =5.434 92
Median distance δM =4
Mean distance δm =4.361 12
Gini coefficient G =0.764 764
Balanced inequality ratio P =0.193 244
Left balanced inequality ratio P1 =0.121 669
Right balanced inequality ratio P2 =0.253 102
Relative edge distribution entropy Her =0.811 363
Power law exponent γ =2.768 07
Tail power law exponent γt =2.241 00
Tail power law exponent with p γ3 =2.241 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =2.001 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =2.361 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.237 056
Degree assortativity p-value pρ =5.140 52 × 10−278
Spectral norm α =416.676
Algebraic connectivity a =0.025 346 5
Spectral separation 1[A] / λ2[A]| =1.116 82
Controllability C =7,490
Relative controllability Cr =0.689 243


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



[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., January 2010.