Wikiquote edits (sv)

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


Internal nameedit-svwikisource
NameWikiquote 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 =92,795
Left size n1 =838
Right size n2 =91,957
Volume m =303,097
Unique edge count m̿ =182,266
Wedge count s =1,141,596,321
Claw count z =6,949,802,886,525
Cross count x =37,539,416,002,437,176
Square count q =148,858,691
4-Tour count T4 =5,757,746,684
Maximum degree dmax =54,062
Maximum left degree d1max =54,062
Maximum right degree d2max =3,470
Average degree d =6.532 61
Average left degree d1 =361.691
Average right degree d2 =3.296 07
Fill p =0.002 365 25
Average edge multiplicity m̃ =1.662 94
Size of LCC N =92,445
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.352 31
90-Percentile effective diameter δ0.9 =3.898 72
Median distance δM =4
Mean distance δm =3.561 88
Gini coefficient G =0.735 920
Balanced inequality ratio P =0.220 053
Left balanced inequality ratio P1 =0.038 842 4
Right balanced inequality ratio P2 =0.329 419
Relative edge distribution entropy Her =0.690 521
Power law exponent γ =2.852 89
Tail power law exponent γt =4.411 00
Degree assortativity ρ =−0.079 889 1
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,942.49
Algebraic connectivity a =0.027 891 2


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

Edge weight/multiplicity distribution

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