Wikiversity edits (ru)

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


Internal nameedit-ruwikiversity
NameWikiversity edits (ru)
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 =22,838
Left size n1 =3,171
Right size n2 =19,667
Volume m =104,220
Unique edge count m̿ =36,215
Wedge count s =42,932,200
Claw count z =69,633,952,284
Cross count x =93,894,737,247,086
Square count q =3,583,059
4-Tour count T4 =200,468,278
Maximum degree dmax =18,217
Maximum left degree d1max =18,217
Maximum right degree d2max =1,585
Average degree d =9.126 89
Average left degree d1 =32.866 6
Average right degree d2 =5.299 23
Fill p =0.000 580 703
Average edge multiplicity m̃ =2.877 81
Size of LCC N =22,079
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.477 17
90-Percentile effective diameter δ0.9 =4.824 75
Median distance δM =4
Mean distance δm =3.884 13
Gini coefficient G =0.804 346
Balanced inequality ratio P =0.173 470
Left balanced inequality ratio P1 =0.114 172
Right balanced inequality ratio P2 =0.243 859
Relative edge distribution entropy Her =0.768 030
Power law exponent γ =3.421 66
Tail power law exponent γt =2.231 00
Tail power law exponent with p γ3 =2.231 00
p-value p =0.213 000
Left tail power law exponent with p γ3,1 =2.061 00
Left p-value p1 =0.226 000
Right tail power law exponent with p γ3,2 =2.551 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.268 613
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,258.88
Algebraic connectivity a =0.030 780 6
Spectral separation 1[A] / λ2[A]| =1.142 89
Controllability C =18,493
Relative controllability Cr =0.814 957


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.