Wiktionary edits (lb)

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


Internal nameedit-lbwiktionary
NameWiktionary edits (lb)
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 =11,811
Left size n1 =278
Right size n2 =11,533
Volume m =69,000
Unique edge count m̿ =38,707
Wedge count s =73,407,593
Claw count z =127,214,442,820
Cross count x =185,208,294,828,275
Square count q =50,090,421
4-Tour count T4 =694,432,538
Maximum degree dmax =15,987
Maximum left degree d1max =15,987
Maximum right degree d2max =257
Average degree d =11.684 0
Average left degree d1 =248.201
Average right degree d2 =5.982 83
Fill p =0.012 072 6
Average edge multiplicity m̃ =1.782 62
Size of LCC N =11,069
Diameter δ =14
50-Percentile effective diameter δ0.5 =1.814 55
90-Percentile effective diameter δ0.9 =3.859 50
Median distance δM =2
Mean distance δm =2.915 55
Gini coefficient G =0.710 803
Balanced inequality ratio P =0.236 580
Left balanced inequality ratio P1 =0.053 565 2
Right balanced inequality ratio P2 =0.341 116
Relative edge distribution entropy Her =0.711 458
Power law exponent γ =1.940 51
Tail power law exponent γt =3.991 00
Tail power law exponent with p γ3 =3.991 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.411 00
Left p-value p1 =0.114 000
Right tail power law exponent with p γ3,2 =8.511 00
Right p-value p2 =0.273 000
Degree assortativity ρ =−0.207 132
Degree assortativity p-value pρ =0.000 00
Spectral norm α =360.532
Spectral separation 1[A] / λ2[A]| =1.367 02
Controllability C =10,707
Relative controllability Cr =0.950 973


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.