Wikipedia edits (sv)

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


Internal nameedit-svwiki
NameWikipedia 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 =7,751,738
Left size n1 =161,302
Right size n2 =7,590,436
Volume m =36,357,003
Unique edge count m̿ =21,943,635
Wedge count s =19,433,128,613,186
Maximum degree dmax =10,345,171
Maximum left degree d1max =10,345,171
Maximum right degree d2max =86,127
Average degree d =9.380 35
Average left degree d1 =225.397
Average right degree d2 =4.789 84
Size of LCC N =7,718,931
Diameter δ =13
50-Percentile effective diameter δ0.5 =1.828 39
90-Percentile effective diameter δ0.9 =3.848 46
Median distance δM =2
Mean distance δm =2.829 02
Balanced inequality ratio P =0.175 253
Left balanced inequality ratio P1 =0.026 644 4
Right balanced inequality ratio P2 =0.265 266
Degree assortativity ρ =−0.201 217
Degree assortativity p-value pρ =0.000 00


Degree distribution

Cumulative degree distribution

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

Hop distribution

Temporal distribution



[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.