Wikipedia edits (za)

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


Internal nameedit-zawiki
NameWikipedia edits (za)
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 =3,503
Left size n1 =686
Right size n2 =2,817
Volume m =21,987
Unique edge count m̿ =10,329
Wedge count s =1,169,119
Claw count z =148,547,356
Cross count x =18,957,306,153
Square count q =2,489,062
4-Tour count T4 =24,612,290
Maximum degree dmax =2,062
Maximum left degree d1max =2,062
Maximum right degree d2max =284
Average degree d =12.553 2
Average left degree d1 =32.051 0
Average right degree d2 =7.805 11
Fill p =0.005 345 00
Average edge multiplicity m̃ =2.128 67
Size of LCC N =2,235
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.483 43
90-Percentile effective diameter δ0.9 =5.655 70
Median distance δM =4
Mean distance δm =4.094 12
Gini coefficient G =0.808 014
Balanced inequality ratio P =0.165 393
Left balanced inequality ratio P1 =0.104 835
Right balanced inequality ratio P2 =0.195 252
Relative edge distribution entropy Her =0.816 730
Power law exponent γ =2.113 32
Tail power law exponent γt =1.731 00
Tail power law exponent with p γ3 =1.731 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.701 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =6.211 00
Right p-value p2 =0.497 000
Degree assortativity ρ =−0.127 276
Degree assortativity p-value pρ =1.458 60 × 10−38
Spectral norm α =234.773
Algebraic connectivity a =0.024 905 0
Spectral separation 1[A] / λ2[A]| =1.715 61
Controllability C =1,565
Relative controllability Cr =0.556 346


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.