Wikibooks edits (ch)

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

Metadata

Codebch
Internal nameedit-chwikibooks
NameWikibooks edits (ch)
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 =84
Left size n1 =24
Right size n2 =60
Volume m =112
Unique edge count m̿ =84
Wedge count s =259
Claw count z =770
Cross count x =1,823
Square count q =57
4-Tour count T4 =1,772
Maximum degree dmax =26
Maximum left degree d1max =26
Maximum right degree d2max =13
Average degree d =2.666 67
Average left degree d1 =4.666 67
Average right degree d2 =1.866 67
Fill p =0.058 333 3
Average edge multiplicity m̃ =1.333 33
Size of LCC N =39
Diameter δ =8
50-Percentile effective diameter δ0.5 =3.788 66
90-Percentile effective diameter δ0.9 =6.500 74
Median distance δM =4
Mean distance δm =4.271 97
Gini coefficient G =0.503 869
Balanced inequality ratio P =0.303 571
Left balanced inequality ratio P1 =0.267 857
Right balanced inequality ratio P2 =0.357 143
Relative edge distribution entropy Her =0.921 253
Power law exponent γ =3.352 70
Tail power law exponent γt =2.731 00
Tail power law exponent with p γ3 =2.731 00
p-value p =0.829 000
Left tail power law exponent with p γ3,1 =2.461 00
Left p-value p1 =0.671 000
Right tail power law exponent with p γ3,2 =4.511 00
Right p-value p2 =0.317 000
Degree assortativity ρ =+0.020 135 4
Degree assortativity p-value pρ =0.855 742
Spectral norm α =7.928 34
Algebraic connectivity a =0.137 288
Spectral separation |λ1[A] / λ2[A]| =1.236 42
Controllability C =38
Relative controllability Cr =0.452 381

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.