Wikibooks edits (ln)

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

Metadata

Codebln
Internal nameedit-lnwikibooks
NameWikibooks edits (ln)
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 =114
Left size n1 =26
Right size n2 =88
Volume m =195
Unique edge count m̿ =129
Wedge count s =866
Claw count z =5,819
Cross count x =32,874
Square count q =288
4-Tour count T4 =6,106
Maximum degree dmax =51
Maximum left degree d1max =51
Maximum right degree d2max =7
Average degree d =3.421 05
Average left degree d1 =7.500 00
Average right degree d2 =2.215 91
Fill p =0.056 381 1
Average edge multiplicity m̃ =1.511 63
Size of LCC N =73
Diameter δ =14
50-Percentile effective diameter δ0.5 =5.026 29
90-Percentile effective diameter δ0.9 =9.063 89
Median distance δM =6
Mean distance δm =5.468 54
Gini coefficient G =0.574 419
Balanced inequality ratio P =0.284 615
Left balanced inequality ratio P1 =0.210 256
Right balanced inequality ratio P2 =0.364 103
Relative edge distribution entropy Her =0.893 242
Power law exponent γ =3.012 67
Tail power law exponent γt =2.311 00
Degree assortativity ρ =+0.338 628
Degree assortativity p-value pρ =8.663 94 × 10−5
Spectral norm α =13.773 0
Algebraic connectivity a =0.018 517 5
Controllability C =62
Relative controllability Cr =0.553 571

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.