Wikibooks edits (as)

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

Metadata

Codebas
Internal nameedit-aswikibooks
NameWikibooks edits (as)
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 =102
Left size n1 =31
Right size n2 =71
Volume m =116
Unique edge count m̿ =95
Wedge count s =317
Claw count z =1,026
Cross count x =2,842
Square count q =80
4-Tour count T4 =2,134
Maximum degree dmax =28
Maximum left degree d1max =28
Maximum right degree d2max =5
Average degree d =2.274 51
Average left degree d1 =3.741 94
Average right degree d2 =1.633 80
Fill p =0.043 162 2
Average edge multiplicity m̃ =1.221 05
Size of LCC N =42
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.644 70
90-Percentile effective diameter δ0.9 =6.143 62
Median distance δM =4
Mean distance δm =4.153 24
Gini coefficient G =0.456 897
Balanced inequality ratio P =0.327 586
Left balanced inequality ratio P1 =0.267 241
Right balanced inequality ratio P2 =0.370 690
Relative edge distribution entropy Her =0.923 688
Power law exponent γ =3.647 49
Tail power law exponent γt =2.901 00
Tail power law exponent with p γ3 =2.901 00
p-value p =0.655 000
Left tail power law exponent with p γ3,1 =2.281 00
Left p-value p1 =0.785 000
Right tail power law exponent with p γ3,2 =4.691 00
Right p-value p2 =0.681 000
Degree assortativity ρ =+0.302 514
Degree assortativity p-value pρ =0.002 885 75
Spectral norm α =8.193 21
Algebraic connectivity a =0.043 612 5
Spectral separation 1[A] / λ2[A]| =2.313 53
Controllability C =39
Relative controllability Cr =0.386 139

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.