Wikiquote edits (is)

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


Internal nameedit-iswikisource
NameWikiquote edits (is)
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,109
Left size n1 =213
Right size n2 =6,896
Volume m =12,118
Unique edge count m̿ =8,947
Wedge count s =9,378,345
Claw count z =8,344,924,827
Cross count x =5,863,079,122,809
Square count q =934,770
4-Tour count T4 =45,019,310
Maximum degree dmax =3,500
Maximum left degree d1max =3,500
Maximum right degree d2max =275
Average degree d =3.409 20
Average left degree d1 =56.892 0
Average right degree d2 =1.757 25
Fill p =0.006 091 17
Average edge multiplicity m̃ =1.354 42
Size of LCC N =6,864
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.256 34
90-Percentile effective diameter δ0.9 =5.183 13
Median distance δM =4
Mean distance δm =3.525 12
Gini coefficient G =0.670 063
Relative edge distribution entropy Her =0.686 533
Power law exponent γ =5.597 09
Tail power law exponent γt =2.741 00
Degree assortativity ρ =−0.290 135
Degree assortativity p-value pρ =4.601 14 × 10−173
Algebraic connectivity a =0.020 897 7


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.