Wikiquote edits (da)

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


Internal nameedit-dawikisource
NameWikiquote edits (da)
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 =21,230
Left size n1 =414
Right size n2 =20,816
Volume m =36,012
Unique edge count m̿ =26,504
Wedge count s =119,199,540
Claw count z =591,193,808,023
Cross count x =2,249,362,030,841,604
Square count q =789,491
4-Tour count T4 =483,172,848
Maximum degree dmax =17,831
Maximum left degree d1max =17,831
Maximum right degree d2max =337
Average degree d =3.392 56
Average left degree d1 =86.985 5
Average right degree d2 =1.730 02
Fill p =0.003 075 49
Average edge multiplicity m̃ =1.358 74
Size of LCC N =20,536
Diameter δ =12
50-Percentile effective diameter δ0.5 =1.862 45
90-Percentile effective diameter δ0.9 =3.866 92
Median distance δM =2
Mean distance δm =2.932 08
Gini coefficient G =0.681 628
Balanced inequality ratio P =0.233 575
Left balanced inequality ratio P1 =0.075 002 8
Right balanced inequality ratio P2 =0.360 408
Relative edge distribution entropy Her =0.678 483
Power law exponent γ =6.176 61
Tail power law exponent γt =2.851 00
Tail power law exponent with p γ3 =2.851 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.591 00
Left p-value p1 =0.413 000
Right tail power law exponent with p γ3,2 =4.191 00
Right p-value p2 =0.012 000 0
Degree assortativity ρ =−0.284 505
Degree assortativity p-value pρ =0.000 00
Spectral norm α =341.886
Algebraic connectivity a =0.000 977 717
Spectral separation 1[A] / λ2[A]| =1.487 27
Controllability C =20,062
Relative controllability Cr =0.962 022


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.