Wikibooks edits (bo)

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

Metadata

Codebbo
Internal nameedit-bowikibooks
NameWikibooks edits (bo)
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 =105
Left size n1 =28
Right size n2 =77
Volume m =142
Unique edge count m̿ =106
Wedge count s =615
Claw count z =3,636
Cross count x =17,798
Square count q =193
4-Tour count T4 =4,220
Maximum degree dmax =43
Maximum left degree d1max =43
Maximum right degree d2max =5
Average degree d =2.704 76
Average left degree d1 =5.071 43
Average right degree d2 =1.844 16
Fill p =0.049 165 1
Average edge multiplicity m̃ =1.339 62
Size of LCC N =39
Diameter δ =8
50-Percentile effective diameter δ0.5 =1.867 33
90-Percentile effective diameter δ0.9 =5.183 89
Median distance δM =2
Mean distance δm =2.924 27
Gini coefficient G =0.497 313
Balanced inequality ratio P =0.320 423
Left balanced inequality ratio P1 =0.246 479
Right balanced inequality ratio P2 =0.366 197
Relative edge distribution entropy Her =0.898 418
Power law exponent γ =3.453 97
Tail power law exponent γt =3.081 00
Tail power law exponent with p γ3 =3.081 00
p-value p =0.065 000 0
Left tail power law exponent with p γ3,1 =2.161 00
Left p-value p1 =0.719 000
Right tail power law exponent with p γ3,2 =6.121 00
Right p-value p2 =0.505 000
Degree assortativity ρ =+0.530 682
Degree assortativity p-value pρ =4.874 74 × 10−9
Spectral norm α =10.153 5
Algebraic connectivity a =0.124 022
Spectral separation |λ1[A] / λ2[A]| =1.566 72
Controllability C =50
Relative controllability Cr =0.480 769

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.