Wikibooks edits (ak)

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

Metadata

Codebak
Internal nameedit-akwikibooks
NameWikibooks edits (ak)
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 =121
Left size n1 =29
Right size n2 =92
Volume m =164
Unique edge count m̿ =120
Wedge count s =1,033
Claw count z =11,296
Cross count x =102,624
Square count q =50
4-Tour count T4 =4,944
Maximum degree dmax =73
Maximum left degree d1max =73
Maximum right degree d2max =6
Average degree d =2.710 74
Average left degree d1 =5.655 17
Average right degree d2 =1.782 61
Fill p =0.044 977 5
Average edge multiplicity m̃ =1.366 67
Size of LCC N =68
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.722 05
90-Percentile effective diameter δ0.9 =4.763 77
Median distance δM =3
Mean distance δm =3.269 66
Gini coefficient G =0.568 995
Balanced inequality ratio P =0.292 683
Left balanced inequality ratio P1 =0.201 220
Right balanced inequality ratio P2 =0.353 659
Relative edge distribution entropy Her =0.870 422
Power law exponent γ =4.127 70
Tail power law exponent γt =2.421 00
Degree assortativity ρ =−0.218 783
Degree assortativity p-value pρ =0.016 362 8
Spectral norm α =14.330 4
Algebraic connectivity a =0.041 431 1
Controllability C =63
Relative controllability Cr =0.520 661

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.