Wikibooks edits (ne)

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

Metadata

Codebne
Internal nameedit-newikibooks
NameWikibooks edits (ne)
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 =2,504
Left size n1 =555
Right size n2 =1,949
Volume m =7,105
Unique edge count m̿ =3,018
Wedge count s =310,310
Claw count z =45,854,693
Cross count x =6,205,189,834
Square count q =6,542
4-Tour count T4 =1,299,708
Maximum degree dmax =1,697
Maximum left degree d1max =1,697
Maximum right degree d2max =915
Average degree d =5.674 92
Average left degree d1 =12.801 8
Average right degree d2 =3.645 46
Fill p =0.002 790 07
Average edge multiplicity m̃ =2.354 21
Size of LCC N =2,288
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.622 86
90-Percentile effective diameter δ0.9 =5.675 73
Median distance δM =4
Mean distance δm =4.249 96
Gini coefficient G =0.777 931
Relative edge distribution entropy Her =0.807 067
Power law exponent γ =4.789 01
Tail power law exponent γt =2.571 00
Tail power law exponent with p γ3 =2.571 00
p-value p =0.003 000 00
Left tail power law exponent with p γ3,1 =2.041 00
Left p-value p1 =0.667 000
Right tail power law exponent with p γ3,2 =2.881 00
Right p-value p2 =0.107 000
Degree assortativity ρ =−0.297 889
Degree assortativity p-value pρ =6.740 09 × 10−63
Spectral norm α =238.732
Algebraic connectivity a =0.016 586 4

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.