Wikiquote edits (ka)

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


Internal nameedit-kawikiquote
NameWikiquote edits (ka)
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 =4,140
Left size n1 =375
Right size n2 =3,765
Volume m =23,721
Unique edge count m̿ =9,407
Wedge count s =2,264,037
Claw count z =615,176,446
Cross count x =149,637,165,297
Square count q =1,311,099
4-Tour count T4 =19,572,342
Maximum degree dmax =6,189
Maximum left degree d1max =6,189
Maximum right degree d2max =1,104
Average degree d =11.459 4
Average left degree d1 =63.256 0
Average right degree d2 =6.300 40
Fill p =0.006 662 77
Average edge multiplicity m̃ =2.521 63
Size of LCC N =3,912
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.386 14
90-Percentile effective diameter δ0.9 =4.943 87
Median distance δM =4
Mean distance δm =3.770 29
Gini coefficient G =0.841 881
Balanced inequality ratio P =0.148 771
Left balanced inequality ratio P1 =0.096 117 4
Right balanced inequality ratio P2 =0.201 762
Relative edge distribution entropy Her =0.770 119
Power law exponent γ =2.793 86
Tail power law exponent γt =2.011 00
Tail power law exponent with p γ3 =2.011 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.611 00
Left p-value p1 =0.845 000
Right tail power law exponent with p γ3,2 =2.091 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.327 090
Degree assortativity p-value pρ =2.026 41 × 10−233
Spectral norm α =1,192.64
Algebraic connectivity a =0.034 138 4
Spectral separation 1[A] / λ2[A]| =5.023 45
Controllability C =3,409
Relative controllability Cr =0.826 825


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.