Wikibooks edits (nah)

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

Metadata

Codebnah
Internal nameedit-nahwikibooks
NameWikibooks edits (nah)
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 =97
Left size n1 =26
Right size n2 =71
Volume m =122
Unique edge count m̿ =94
Wedge count s =331
Claw count z =1,078
Cross count x =2,983
Square count q =93
4-Tour count T4 =2,304
Maximum degree dmax =30
Maximum left degree d1max =30
Maximum right degree d2max =11
Average degree d =2.515 46
Average left degree d1 =4.692 31
Average right degree d2 =1.718 31
Fill p =0.050 920 9
Average edge multiplicity m̃ =1.297 87
Size of LCC N =26
Diameter δ =7
50-Percentile effective diameter δ0.5 =3.102 13
90-Percentile effective diameter δ0.9 =4.850 00
Median distance δM =4
Mean distance δm =3.412 16
Gini coefficient G =0.478 806
Balanced inequality ratio P =0.323 770
Left balanced inequality ratio P1 =0.286 885
Right balanced inequality ratio P2 =0.368 852
Relative edge distribution entropy Her =0.919 908
Power law exponent γ =3.470 80
Tail power law exponent γt =2.931 00
Degree assortativity ρ =+0.195 165
Degree assortativity p-value pρ =0.059 423 2
Algebraic connectivity a =0.102 239
Spectral separation 1[A] / λ2[A]| =1.170 92
Controllability C =44
Relative controllability Cr =0.458 333

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.