Wikiquote edits (lb)

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


Internal nameedit-lbwikiquote
NameWikiquote edits (lb)
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 =423
Left size n1 =85
Right size n2 =338
Volume m =667
Unique edge count m̿ =486
Wedge count s =9,271
Claw count z =229,073
Cross count x =5,104,502
Square count q =1,004
4-Tour count T4 =46,372
Maximum degree dmax =108
Maximum left degree d1max =108
Maximum right degree d2max =38
Average degree d =3.153 66
Average left degree d1 =7.847 06
Average right degree d2 =1.973 37
Fill p =0.016 916 1
Average edge multiplicity m̃ =1.372 43
Size of LCC N =153
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.097 33
90-Percentile effective diameter δ0.9 =4.810 08
Median distance δM =4
Mean distance δm =3.483 04
Gini coefficient G =0.647 308
Balanced inequality ratio P =0.238 381
Left balanced inequality ratio P1 =0.179 910
Right balanced inequality ratio P2 =0.332 834
Relative edge distribution entropy Her =0.856 633
Power law exponent γ =3.862 30
Tail power law exponent γt =2.351 00
Tail power law exponent with p γ3 =2.351 00
p-value p =0.447 000
Left tail power law exponent with p γ3,1 =1.781 00
Left p-value p1 =0.676 000
Right tail power law exponent with p γ3,2 =2.691 00
Right p-value p2 =0.014 000 0
Degree assortativity ρ =−0.238 694
Degree assortativity p-value pρ =1.005 49 × 10−7
Spectral norm α =38.223 0
Algebraic connectivity a =0.050 591 8
Spectral separation 1[A] / λ2[A]| =2.245 50
Controllability C =260
Relative controllability Cr =0.616 114


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.