Wikiquote edits (tr)

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


Internal nameedit-trwikiquote
NameWikiquote edits (tr)
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 =19,818
Left size n1 =2,619
Right size n2 =17,199
Volume m =100,424
Unique edge count m̿ =53,828
Wedge count s =40,206,964
Claw count z =43,078,963,516
Cross count x =46,428,252,298,696
Square count q =16,090,634
4-Tour count T4 =289,698,172
Maximum degree dmax =12,539
Maximum left degree d1max =12,539
Maximum right degree d2max =908
Average degree d =10.134 6
Average left degree d1 =38.344 4
Average right degree d2 =5.838 94
Fill p =0.001 195 00
Average edge multiplicity m̃ =1.865 65
Size of LCC N =19,130
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.336 42
90-Percentile effective diameter δ0.9 =4.373 93
Median distance δM =4
Mean distance δm =3.678 80
Gini coefficient G =0.817 106
Balanced inequality ratio P =0.169 332
Left balanced inequality ratio P1 =0.077 262 4
Right balanced inequality ratio P2 =0.230 831
Relative edge distribution entropy Her =0.768 721
Power law exponent γ =2.452 67
Tail power law exponent γt =2.411 00
Tail power law exponent with p γ3 =2.411 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.871 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =3.861 00
Right p-value p2 =0.561 000
Degree assortativity ρ =−0.208 595
Degree assortativity p-value pρ =0.000 00
Spectral norm α =588.005
Algebraic connectivity a =0.020 767 0
Spectral separation 1[A] / λ2[A]| =1.046 24
Controllability C =15,912
Relative controllability Cr =0.808 126


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

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.