Wikiquote edits (ar)

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

Metadata

Codeqar
Internal nameedit-arwikiquote
NameWikiquote 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 =23,375
Left size n1 =1,507
Right size n2 =21,868
Volume m =43,758
Unique edge count m̿ =33,167
Wedge count s =81,978,401
Claw count z =263,287,859,132
Cross count x =709,880,211,523,052
Square count q =2,427,029
4-Tour count T4 =347,400,338
Maximum degree dmax =12,476
Maximum left degree d1max =12,476
Maximum right degree d2max =814
Average degree d =3.744 00
Average left degree d1 =29.036 5
Average right degree d2 =2.001 01
Fill p =0.001 006 43
Average edge multiplicity m̃ =1.319 32
Size of LCC N =22,553
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.244 16
90-Percentile effective diameter δ0.9 =3.906 32
Median distance δM =4
Mean distance δm =3.395 16
Gini coefficient G =0.718 286
Balanced inequality ratio P =0.207 779
Left balanced inequality ratio P1 =0.090 886 2
Right balanced inequality ratio P2 =0.331 002
Relative edge distribution entropy Her =0.714 547
Power law exponent γ =4.970 52
Tail power law exponent with p γ3 =2.611 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.901 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =2.721 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.302 087
Degree assortativity p-value pρ =0.000 00
Spectral norm α =332.730
Algebraic connectivity a =0.060 797 9
Spectral separation 1[A] / λ2[A]| =1.965 16
Controllability C =20,811
Relative controllability Cr =0.893 636

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.