Wikibooks edits (bi)

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

Metadata

Codebbi
Internal nameedit-biwikibooks
NameWikibooks edits (bi)
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 =78
Left size n1 =24
Right size n2 =54
Volume m =79
Unique edge count m̿ =67
Wedge count s =124
Claw count z =167
Cross count x =168
Square count q =7
4-Tour count T4 =718
Maximum degree dmax =10
Maximum left degree d1max =10
Maximum right degree d2max =6
Average degree d =2.025 64
Average left degree d1 =3.291 67
Average right degree d2 =1.462 96
Fill p =0.051 697 5
Average edge multiplicity m̃ =1.179 10
Size of LCC N =21
Diameter δ =6
50-Percentile effective diameter δ0.5 =2.509 17
90-Percentile effective diameter δ0.9 =4.138 24
Median distance δM =3
Mean distance δm =2.961 63
Gini coefficient G =0.429 442
Balanced inequality ratio P =0.329 114
Left balanced inequality ratio P1 =0.341 772
Right balanced inequality ratio P2 =0.405 063
Relative edge distribution entropy Her =0.942 556
Power law exponent γ =3.962 59
Tail power law exponent γt =2.371 00
Tail power law exponent with p γ3 =2.371 00
p-value p =0.300 000
Left tail power law exponent with p γ3,1 =3.491 00
Left p-value p1 =0.136 000
Right tail power law exponent with p γ3,2 =3.121 00
Right p-value p2 =0.141 000
Degree assortativity ρ =−0.018 052 4
Degree assortativity p-value pρ =0.884 714
Spectral norm α =4.724 99
Algebraic connectivity a =0.117 040
Spectral separation |λ1[A] / λ2[A]| =1.169 49
Controllability C =30
Relative controllability Cr =0.384 615

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

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.