Wikipedia edits (cu)

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


Internal nameedit-cuwiki
NameWikipedia edits (cu)
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 =5,516
Left size n1 =1,054
Right size n2 =4,462
Volume m =63,049
Unique edge count m̿ =24,420
Wedge count s =7,639,500
Claw count z =4,039,245,707
Cross count x =2,345,346,945,437
Square count q =15,289,820
4-Tour count T4 =152,959,124
Maximum degree dmax =8,635
Maximum left degree d1max =8,635
Maximum right degree d2max =590
Average degree d =22.860 4
Average left degree d1 =59.818 8
Average right degree d2 =14.130 2
Fill p =0.005 192 49
Average edge multiplicity m̃ =2.581 86
Size of LCC N =4,783
Diameter δ =13
50-Percentile effective diameter δ0.5 =2.790 26
90-Percentile effective diameter δ0.9 =4.463 82
Median distance δM =3
Mean distance δm =3.309 83
Gini coefficient G =0.852 512
Balanced inequality ratio P =0.148 337
Left balanced inequality ratio P1 =0.075 560 3
Right balanced inequality ratio P2 =0.186 728
Relative edge distribution entropy Her =0.790 169
Power law exponent γ =2.065 45
Tail power law exponent γt =1.711 00
Tail power law exponent with p γ3 =1.711 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 =1.831 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.296 123
Degree assortativity p-value pρ =0.000 00
Spectral norm α =619.092
Algebraic connectivity a =0.026 006 0
Spectral separation 1[A] / λ2[A]| =1.316 92
Controllability C =3,574
Relative controllability Cr =0.650 765


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.