Wikiversity edits (sv)

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


Internal nameedit-svwikiversity
NameWikiversity edits (sv)
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,417
Left size n1 =806
Right size n2 =2,611
Volume m =18,300
Unique edge count m̿ =5,761
Wedge count s =656,692
Claw count z =123,074,822
Cross count x =20,337,674,407
Square count q =127,030
4-Tour count T4 =3,654,758
Maximum degree dmax =1,730
Maximum left degree d1max =1,730
Maximum right degree d2max =345
Average degree d =10.711 2
Average left degree d1 =22.704 7
Average right degree d2 =7.008 81
Fill p =0.002 737 51
Average edge multiplicity m̃ =3.176 53
Size of LCC N =3,184
Diameter δ =15
50-Percentile effective diameter δ0.5 =3.910 13
90-Percentile effective diameter δ0.9 =6.263 20
Median distance δM =4
Mean distance δm =4.636 42
Gini coefficient G =0.761 704
Balanced inequality ratio P =0.203 934
Left balanced inequality ratio P1 =0.135 355
Right balanced inequality ratio P2 =0.242 514
Relative edge distribution entropy Her =0.830 588
Power law exponent γ =2.905 47
Tail power law exponent γt =2.181 00
Tail power law exponent with p γ3 =2.181 00
p-value p =0.416 000
Left tail power law exponent with p γ3,1 =1.841 00
Left p-value p1 =0.072 000 0
Right tail power law exponent with p γ3,2 =2.561 00
Right p-value p2 =0.270 000
Degree assortativity ρ =−0.277 999
Degree assortativity p-value pρ =9.794 31 × 10−103
Spectral norm α =252.726
Algebraic connectivity a =0.006 421 33
Spectral separation 1[A] / λ2[A]| =1.005 81
Controllability C =2,474
Relative controllability Cr =0.728 075


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.