Wikiquote edits (nl)

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


Internal nameedit-nlwikisource
NameWikiquote edits (nl)
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 =19,504
Left size n1 =1,243
Right size n2 =18,261
Volume m =55,674
Unique edge count m̿ =31,912
Wedge count s =33,329,058
Claw count z =40,767,388,702
Cross count x =41,826,659,928,928
Square count q =3,950,174
4-Tour count T4 =164,993,304
Maximum degree dmax =7,676
Maximum left degree d1max =7,676
Maximum right degree d2max =1,056
Average degree d =5.708 98
Average left degree d1 =44.790 0
Average right degree d2 =3.048 79
Fill p =0.001 405 91
Average edge multiplicity m̃ =1.744 61
Size of LCC N =19,182
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.421 29
90-Percentile effective diameter δ0.9 =4.008 79
Median distance δM =4
Mean distance δm =3.755 32
Gini coefficient G =0.737 560
Balanced inequality ratio P =0.213 286
Left balanced inequality ratio P1 =0.087 347 8
Right balanced inequality ratio P2 =0.311 510
Relative edge distribution entropy Her =0.746 945
Power law exponent γ =3.518 28
Tail power law exponent γt =2.231 00
Tail power law exponent with p γ3 =2.231 00
p-value p =0.001 000 00
Left tail power law exponent with p γ3,1 =1.721 00
Left p-value p1 =0.976 000
Right tail power law exponent with p γ3,2 =3.261 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.288 202
Degree assortativity p-value pρ =0.000 00
Spectral norm α =392.553
Algebraic connectivity a =0.028 784 4
Spectral separation 1[A] / λ2[A]| =1.494 61
Controllability C =17,743
Relative controllability Cr =0.913 223


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.