Wiktionary edits (nds)

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


Internal nameedit-ndswiktionary
NameWiktionary edits (nds)
Data sourcehttp://dumps.wikimedia.org/
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 =33,077
Left size n1 =280
Right size n2 =32,797
Volume m =115,434
Unique edge count m̿ =67,502
Wedge count s =449,749,485
Claw count z =3,592,452,275,212
Cross count x =24,154,428,143,422,256
Square count q =72,646,500
4-Tour count T4 =2,380,308,084
Maximum degree dmax =44,559
Maximum left degree d1max =44,559
Maximum right degree d2max =281
Average degree d =6.979 71
Average left degree d1 =412.264
Average right degree d2 =3.519 65
Fill p =0.007 350 63
Average edge multiplicity m̃ =1.710 08
Size of LCC N =32,807
Diameter δ =12
50-Percentile effective diameter δ0.5 =1.645 94
90-Percentile effective diameter δ0.9 =3.580 10
Median distance δM =2
Mean distance δm =2.474 32
Gini coefficient G =0.774 638
Balanced inequality ratio P =0.194 912
Left balanced inequality ratio P1 =0.039 130 6
Right balanced inequality ratio P2 =0.282 577
Relative edge distribution entropy Her =0.663 697
Power law exponent γ =3.124 46
Tail power law exponent γt =3.551 00
Degree assortativity ρ =−0.460 696
Degree assortativity p-value pρ =0.000 00
Spectral norm α =570.816
Algebraic connectivity a =0.026 605 6
Spectral separation 1[A] / λ2[A]| =2.155 28
Controllability C =32,496
Relative controllability Cr =0.983 357


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

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. http://dumps.wikimedia.org/, January 2010.