Wikiquote edits (nl)

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


Internal nameedit-nlwikiquote
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 =6,411
Left size n1 =1,054
Right size n2 =5,357
Volume m =49,046
Unique edge count m̿ =15,905
Wedge count s =5,615,720
Claw count z =2,906,689,313
Cross count x =1,442,119,258,161
Square count q =2,546,009
4-Tour count T4 =42,867,366
Maximum degree dmax =12,728
Maximum left degree d1max =12,728
Maximum right degree d2max =3,664
Average degree d =15.300 6
Average left degree d1 =46.533 2
Average right degree d2 =9.155 50
Fill p =0.002 816 90
Average edge multiplicity m̃ =3.083 68
Size of LCC N =6,140
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.286 05
90-Percentile effective diameter δ0.9 =4.311 59
Median distance δM =4
Mean distance δm =3.622 55
Gini coefficient G =0.857 153
Balanced inequality ratio P =0.145 883
Left balanced inequality ratio P1 =0.082 167 8
Right balanced inequality ratio P2 =0.188 231
Relative edge distribution entropy Her =0.782 193
Power law exponent γ =2.516 46
Tail power law exponent γt =2.051 00
Tail power law exponent with p γ3 =2.051 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.731 00
Left p-value p1 =0.462 000
Right tail power law exponent with p γ3,2 =4.061 00
Right p-value p2 =0.117 000
Degree assortativity ρ =−0.249 707
Degree assortativity p-value pρ =1.180 71 × 10−224
Spectral norm α =2,071.82
Algebraic connectivity a =0.058 644 2
Spectral separation 1[A] / λ2[A]| =2.495 81
Controllability C =4,792
Relative controllability Cr =0.751 097


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.