Wikibooks edits (ar)

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

Metadata

Codebar
Internal nameedit-arwikibooks
NameWikibooks edits (ar)
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 =32,565
Left size n1 =1,329
Right size n2 =31,236
Volume m =58,217
Unique edge count m̿ =44,214
Wedge count s =201,271,572
Claw count z =941,646,585,167
Square count q =14,085,076
4-Tour count T4 =917,961,452
Maximum degree dmax =17,984
Maximum left degree d1max =17,984
Maximum right degree d2max =1,401
Average degree d =3.575 43
Average left degree d1 =43.805 1
Average right degree d2 =1.863 78
Fill p =0.001 065 07
Average edge multiplicity m̃ =1.316 71
Size of LCC N =31,795
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.009 28
90-Percentile effective diameter δ0.9 =3.869 44
Median distance δM =4
Mean distance δm =3.136 70
Gini coefficient G =0.702 634
Balanced inequality ratio P =0.211 184
Left balanced inequality ratio P1 =0.074 480 0
Right balanced inequality ratio P2 =0.346 668
Relative edge distribution entropy Her =0.675 294
Power law exponent γ =5.497 13
Tail power law exponent γt =2.721 00
Tail power law exponent with p γ3 =2.721 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =2.021 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =3.451 00
Right p-value p2 =0.807 000
Degree assortativity ρ =−0.238 596
Degree assortativity p-value pρ =0.000 00
Spectral norm α =286.604
Spectral separation 1[A] / λ2[A]| =1.334 81
Controllability C =30,238
Relative controllability Cr =0.933 877

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

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.