Wikibooks edits (sw)

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

Metadata

Codebsw
Internal nameedit-swwikibooks
NameWikibooks edits (sw)
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 =264
Left size n1 =53
Right size n2 =211
Volume m =297
Unique edge count m̿ =227
Wedge count s =4,386
Claw count z =122,016
Cross count x =2,673,497
Square count q =23
4-Tour count T4 =18,218
Maximum degree dmax =93
Maximum left degree d1max =93
Maximum right degree d2max =42
Average degree d =2.250 00
Average left degree d1 =5.603 77
Average right degree d2 =1.407 58
Fill p =0.020 298 7
Average edge multiplicity m̃ =1.308 37
Size of LCC N =124
Diameter δ =12
50-Percentile effective diameter δ0.5 =1.793 09
90-Percentile effective diameter δ0.9 =9.086 42
Median distance δM =2
Mean distance δm =3.839 93
Gini coefficient G =0.574 321
Relative edge distribution entropy Her =0.855 632
Power law exponent γ =5.660 13
Tail power law exponent γt =2.751 00
Tail power law exponent with p γ3 =2.751 00
p-value p =0.305 000
Left tail power law exponent with p γ3,1 =2.141 00
Left p-value p1 =0.359 000
Right tail power law exponent with p γ3,2 =3.761 00
Right p-value p2 =0.018 000 0
Degree assortativity ρ =−0.255 578
Degree assortativity p-value pρ =9.848 92 × 10−5
Spectral norm α =42.272 9
Algebraic connectivity a =0.011 939 9
Controllability C =154
Relative controllability Cr =0.606 299

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.