Wiktionary edits (als)

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


Internal nameedit-alswiktionary
NameWiktionary edits (als)
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 =1,271
Left size n1 =45
Right size n2 =1,226
Volume m =1,385
Unique edge count m̿ =1,270
Wedge count s =516,647
Claw count z =172,847,098
Cross count x =43,618,512,213
Square count q =152
4-Tour count T4 =2,074,396
Maximum degree dmax =1,058
Maximum left degree d1max =1,058
Maximum right degree d2max =12
Average degree d =2.179 39
Average left degree d1 =30.777 8
Average right degree d2 =1.129 69
Fill p =0.023 019 8
Average edge multiplicity m̃ =1.090 55
Size of LCC N =1,113
Diameter δ =9
50-Percentile effective diameter δ0.5 =1.606 61
90-Percentile effective diameter δ0.9 =5.294 25
Median distance δM =2
Mean distance δm =2.645 70
Gini coefficient G =0.552 668
Balanced inequality ratio P =0.305 054
Left balanced inequality ratio P1 =0.075 812 3
Right balanced inequality ratio P2 =0.468 592
Relative edge distribution entropy Her =0.664 447
Power law exponent γ =19.823 0
Tail power law exponent γt =4.211 00
Tail power law exponent with p γ3 =4.211 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.751 00
Left p-value p1 =0.079 000 0
Right tail power law exponent with p γ3,2 =5.211 00
Right p-value p2 =0.909 000
Degree assortativity ρ =−0.423 530
Degree assortativity p-value pρ =1.944 56 × 10−56
Spectral norm α =35.441 1
Algebraic connectivity a =0.040 127 6
Spectral separation 1[A] / λ2[A]| =2.245 55
Controllability C =1,183
Relative controllability Cr =0.930 763


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