Wikiquote edits (el)

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


Internal nameedit-elwikiquote
NameWikiquote edits (el)
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,390
Left size n1 =553
Right size n2 =3,837
Volume m =20,779
Unique edge count m̿ =10,760
Wedge count s =3,283,792
Claw count z =1,389,322,515
Cross count x =519,501,603,459
Square count q =1,409,427
4-Tour count T4 =24,446,696
Maximum degree dmax =2,561
Maximum left degree d1max =2,561
Maximum right degree d2max =241
Average degree d =9.466 51
Average left degree d1 =37.575 0
Average right degree d2 =5.415 43
Fill p =0.005 071 02
Average edge multiplicity m̃ =1.931 13
Size of LCC N =3,980
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.288 01
90-Percentile effective diameter δ0.9 =4.553 18
Median distance δM =4
Mean distance δm =3.602 65
Gini coefficient G =0.795 443
Balanced inequality ratio P =0.179 701
Left balanced inequality ratio P1 =0.097 550 4
Right balanced inequality ratio P2 =0.247 317
Relative edge distribution entropy Her =0.781 382
Power law exponent γ =2.452 64
Tail power law exponent γt =2.091 00
Tail power law exponent with p γ3 =2.091 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.691 00
Left p-value p1 =0.367 000
Right tail power law exponent with p γ3,2 =6.091 00
Right p-value p2 =0.463 000
Degree assortativity ρ =−0.311 531
Degree assortativity p-value pρ =8.005 73 × 10−241
Spectral norm α =199.057
Algebraic connectivity a =0.042 740 6
Spectral separation 1[A] / λ2[A]| =1.068 31
Controllability C =3,327
Relative controllability Cr =0.766 413


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.