Wikibooks edits (lb)

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

Metadata

Codeblb
Internal nameedit-lbwikibooks
NameWikibooks edits (lb)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
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

Statistics

Size n =175
Left size n1 =43
Right size n2 =132
Volume m =208
Unique edge count m̿ =149
Wedge count s =1,379
Claw count z =18,834
Cross count x =212,593
Square count q =7
4-Tour count T4 =5,910
Maximum degree dmax =56
Maximum left degree d1max =56
Maximum right degree d2max =43
Average degree d =2.377 14
Average left degree d1 =4.837 21
Average right degree d2 =1.575 76
Fill p =0.026 250 9
Average edge multiplicity m̃ =1.395 97
Size of LCC N =82
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.879 03
90-Percentile effective diameter δ0.9 =6.370 05
Median distance δM =3
Mean distance δm =3.924 39
Gini coefficient G =0.586 502
Balanced inequality ratio P =0.271 635
Left balanced inequality ratio P1 =0.245 192
Right balanced inequality ratio P2 =0.379 808
Relative edge distribution entropy Her =0.883 579
Power law exponent γ =5.270 37
Tail power law exponent γt =2.681 00
Degree assortativity ρ =−0.212 151
Degree assortativity p-value pρ =0.009 391 59
Spectral norm α =43.197 2
Algebraic connectivity a =0.017 855 1
Controllability C =86
Relative controllability Cr =0.500 000

Plots

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

Downloads

References

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