Wikiquote edits (th)

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


Internal nameedit-thwikiquote
NameWikiquote edits (th)
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 =6,970
Left size n1 =405
Right size n2 =6,565
Volume m =14,858
Unique edge count m̿ =8,790
Wedge count s =4,034,841
Claw count z =2,071,440,847
Cross count x =857,442,965,439
Square count q =104,844
4-Tour count T4 =16,996,328
Maximum degree dmax =3,575
Maximum left degree d1max =3,575
Maximum right degree d2max =247
Average degree d =4.263 41
Average left degree d1 =36.686 4
Average right degree d2 =2.263 21
Fill p =0.003 305 97
Average edge multiplicity m̃ =1.690 33
Size of LCC N =6,640
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.691 81
90-Percentile effective diameter δ0.9 =5.763 81
Median distance δM =4
Mean distance δm =4.369 20
Gini coefficient G =0.719 256
Balanced inequality ratio P =0.217 560
Left balanced inequality ratio P1 =0.099 138 5
Right balanced inequality ratio P2 =0.320 905
Relative edge distribution entropy Her =0.751 296
Power law exponent γ =5.186 47
Tail power law exponent γt =2.661 00
Tail power law exponent with p γ3 =2.661 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.711 00
Left p-value p1 =0.780 000
Right tail power law exponent with p γ3,2 =3.481 00
Right p-value p2 =0.003 000 00
Degree assortativity ρ =−0.369 098
Degree assortativity p-value pρ =7.730 21 × 10−282
Spectral norm α =268.443
Algebraic connectivity a =0.014 256 0
Spectral separation 1[A] / λ2[A]| =1.856 26
Controllability C =6,072
Relative controllability Cr =0.886 941


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.