Wikiquote edits (kk)

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


Internal nameedit-kkwikiquote
NameWikiquote edits (kk)
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 =176
Left size n1 =39
Right size n2 =137
Volume m =200
Unique edge count m̿ =136
Wedge count s =1,207
Claw count z =15,543
Cross count x =163,831
Square count q =3
4-Tour count T4 =5,168
Maximum degree dmax =53
Maximum left degree d1max =53
Maximum right degree d2max =38
Average degree d =2.272 73
Average left degree d1 =5.128 21
Average right degree d2 =1.459 85
Fill p =0.025 453 9
Average edge multiplicity m̃ =1.470 59
Size of LCC N =50
Diameter δ =4
50-Percentile effective diameter δ0.5 =1.522 16
90-Percentile effective diameter δ0.9 =1.992 71
Median distance δM =2
Mean distance δm =2.093 81
Gini coefficient G =0.592 598
Balanced inequality ratio P =0.270 000
Left balanced inequality ratio P1 =0.225 000
Right balanced inequality ratio P2 =0.380 000
Relative edge distribution entropy Her =0.881 597
Power law exponent γ =6.019 72
Tail power law exponent γt =2.821 00
Tail power law exponent with p γ3 =2.821 00
p-value p =0.186 000
Left tail power law exponent with p γ3,1 =2.221 00
Left p-value p1 =0.528 000
Right tail power law exponent with p γ3,2 =4.161 00
Right p-value p2 =0.684 000
Degree assortativity ρ =−0.240 697
Degree assortativity p-value pρ =0.004 762 10
Spectral norm α =38.301 4
Spectral separation 1[A] / λ2[A]| =4.485 16
Controllability C =85
Relative controllability Cr =0.521 472


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 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.