Wikibooks edits (bm)

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

Metadata

Codebbm
Internal nameedit-bmwikibooks
NameWikibooks edits (bm)
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 =79
Left size n1 =25
Right size n2 =54
Volume m =75
Unique edge count m̿ =63
Wedge count s =96
Claw count z =102
Cross count x =88
Square count q =4
4-Tour count T4 =558
Maximum degree dmax =8
Maximum left degree d1max =8
Maximum right degree d2max =5
Average degree d =1.898 73
Average left degree d1 =3.000 00
Average right degree d2 =1.388 89
Fill p =0.046 666 7
Average edge multiplicity m̃ =1.190 48
Size of LCC N =13
Diameter δ =5
50-Percentile effective diameter δ0.5 =2.071 43
90-Percentile effective diameter δ0.9 =3.784 21
Median distance δM =3
Mean distance δm =2.563 95
Gini coefficient G =0.402 963
Balanced inequality ratio P =0.340 000
Left balanced inequality ratio P1 =0.346 667
Right balanced inequality ratio P2 =0.413 333
Relative edge distribution entropy Her =0.951 169
Power law exponent γ =4.280 23
Tail power law exponent γt =2.451 00
Degree assortativity ρ =−0.030 260 4
Degree assortativity p-value pρ =0.813 876
Spectral norm α =4.175 17
Algebraic connectivity a =0.177 502
Spectral separation 1[A] / λ2[A]| =1.252 32
Controllability C =28
Relative controllability Cr =0.358 974

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

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.