Wikiquote edits (az)

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


Internal nameedit-azwikiquote
NameWikiquote edits (az)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
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


Size n =5,046
Left size n1 =451
Right size n2 =4,595
Volume m =42,321
Unique edge count m̿ =10,094
Wedge count s =3,601,633
Claw count z =1,444,357,515
Cross count x =487,736,654,044
Square count q =871,930
4-Tour count T4 =21,402,296
Maximum degree dmax =27,063
Maximum left degree d1max =27,063
Maximum right degree d2max =1,017
Average degree d =16.774 1
Average left degree d1 =93.838 1
Average right degree d2 =9.210 23
Fill p =0.004 870 81
Average edge multiplicity m̃ =4.192 69
Size of LCC N =4,716
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.344 68
90-Percentile effective diameter δ0.9 =5.068 79
Median distance δM =4
Mean distance δm =3.684 12
Gini coefficient G =0.846 011
Balanced inequality ratio P =0.159 401
Left balanced inequality ratio P1 =0.056 685 8
Right balanced inequality ratio P2 =0.210 250
Relative edge distribution entropy Her =0.759 380
Power law exponent γ =2.950 72
Tail power law exponent γt =2.071 00
Tail power law exponent with p γ3 =2.071 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.721 00
Left p-value p1 =0.011 000 0
Right tail power law exponent with p γ3,2 =2.131 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.317 982
Degree assortativity p-value pρ =6.231 60 × 10−236
Spectral norm α =1,738.72
Algebraic connectivity a =0.034 369 1
Spectral separation 1[A] / λ2[A]| =6.164 47
Controllability C =4,147
Relative controllability Cr =0.833 735


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



[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., January 2010.