Wikibooks edits (aa)

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

Metadata

Codebaa
Internal nameedit-aawikibooks
NameWikibooks edits (aa)
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 =115
Left size n1 =36
Right size n2 =79
Volume m =119
Unique edge count m̿ =100
Wedge count s =228
Claw count z =440
Cross count x =702
Square count q =50
4-Tour count T4 =1,540
Maximum degree dmax =21
Maximum left degree d1max =21
Maximum right degree d2max =4
Average degree d =2.069 57
Average left degree d1 =3.305 56
Average right degree d2 =1.506 33
Fill p =0.035 161 7
Average edge multiplicity m̃ =1.190 00
Size of LCC N =15
Diameter δ =6
50-Percentile effective diameter δ0.5 =1.900 00
90-Percentile effective diameter δ0.9 =3.848 00
Median distance δM =2
Mean distance δm =2.576 27
Gini coefficient G =0.410 488
Balanced inequality ratio P =0.348 739
Left balanced inequality ratio P1 =0.294 118
Right balanced inequality ratio P2 =0.394 958
Relative edge distribution entropy Her =0.941 207
Power law exponent γ =3.930 59
Tail power law exponent γt =3.001 00
Tail power law exponent with p γ3 =3.001 00
p-value p =0.156 000
Left tail power law exponent with p γ3,1 =2.351 00
Left p-value p1 =0.571 000
Right tail power law exponent with p γ3,2 =6.231 00
Right p-value p2 =0.652 000
Degree assortativity ρ =+0.432 460
Degree assortativity p-value pρ =7.013 66 × 10−6
Spectral norm α =7.127 63
Algebraic connectivity a =0.087 560 7
Spectral separation |λ1[A] / λ2[A]| =1.671 14
Controllability C =43
Relative controllability Cr =0.373 913

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

Inter-event distribution

Node-level inter-event 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.