Wikiquote edits (tk)

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


Internal nameedit-tkwikiquote
NameWikiquote edits (tk)
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 =93
Left size n1 =27
Right size n2 =66
Volume m =95
Unique edge count m̿ =82
Wedge count s =158
Claw count z =227
Cross count x =233
Square count q =14
4-Tour count T4 =960
Maximum degree dmax =13
Maximum left degree d1max =13
Maximum right degree d2max =4
Average degree d =2.043 01
Average left degree d1 =3.518 52
Average right degree d2 =1.439 39
Fill p =0.046 015 7
Average edge multiplicity m̃ =1.158 54
Size of LCC N =12
Diameter δ =7
50-Percentile effective diameter δ0.5 =1.843 75
90-Percentile effective diameter δ0.9 =4.675 00
Median distance δM =2
Mean distance δm =2.641 51
Gini coefficient G =0.427 592
Balanced inequality ratio P =0.326 316
Left balanced inequality ratio P1 =0.315 789
Right balanced inequality ratio P2 =0.400 000
Relative edge distribution entropy Her =0.943 613
Power law exponent γ =3.779 21
Tail power law exponent γt =2.861 00
Tail power law exponent with p γ3 =2.861 00
p-value p =0.241 000
Left tail power law exponent with p γ3,1 =2.251 00
Left p-value p1 =0.042 000 0
Right tail power law exponent with p γ3,2 =7.181 00
Right p-value p2 =0.879 000
Degree assortativity ρ =+0.081 080 2
Degree assortativity p-value pρ =0.468 983
Spectral norm α =5.239 62
Algebraic connectivity a =0.143 132
Spectral separation 1[A] / λ2[A]| =1.438 46
Controllability C =39
Relative controllability Cr =0.419 355


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

Inter-event distribution

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.