Wikipedia edits (lb)

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


Internal nameedit-lbwiki
NameWikipedia 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 =114,727
Left size n1 =5,074
Right size n2 =109,653
Volume m =1,875,160
Unique edge count m̿ =796,539
Wedge count s =8,726,515,024
Cross count x =1,539,230,952,568,286,208
Square count q =19,063,161,162
4-Tour count T4 =187,414,272,590
Maximum degree dmax =236,379
Maximum left degree d1max =236,379
Maximum right degree d2max =5,206
Average degree d =32.689 1
Average left degree d1 =369.562
Average right degree d2 =17.100 9
Fill p =0.001 431 65
Average edge multiplicity m̃ =2.354 13
Size of LCC N =113,353
Diameter δ =10
50-Percentile effective diameter δ0.5 =1.903 97
90-Percentile effective diameter δ0.9 =3.747 23
Median distance δM =2
Mean distance δm =2.820 55
Gini coefficient G =0.832 876
Balanced inequality ratio P =0.173 318
Left balanced inequality ratio P1 =0.022 969 8
Right balanced inequality ratio P2 =0.239 863
Relative edge distribution entropy Her =0.717 605
Power law exponent γ =1.768 53
Tail power law exponent with p γ3 =3.481 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.721 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =5.131 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.318 654
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,605.88
Algebraic connectivity a =0.071 610 3
Spectral separation 1[A] / λ2[A]| =1.527 33
Controllability C =104,413
Relative controllability Cr =0.916 056


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

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal 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.