Wikivoyage edits (el)

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


Internal nameedit-elwikivoyage
NameWikivoyage 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 =2,759
Left size n1 =293
Right size n2 =2,466
Volume m =19,378
Unique edge count m̿ =5,128
Wedge count s =1,357,788
Claw count z =420,615,135
Cross count x =108,290,622,444
Square count q =247,465
4-Tour count T4 =7,423,508
Maximum degree dmax =8,674
Maximum left degree d1max =8,674
Maximum right degree d2max =246
Average degree d =14.047 1
Average left degree d1 =66.136 5
Average right degree d2 =7.858 07
Fill p =0.007 097 20
Average edge multiplicity m̃ =3.778 86
Size of LCC N =2,577
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.034 69
90-Percentile effective diameter δ0.9 =3.872 60
Median distance δM =4
Mean distance δm =3.197 11
Gini coefficient G =0.798 831
Balanced inequality ratio P =0.184 436
Left balanced inequality ratio P1 =0.071 834 0
Right balanced inequality ratio P2 =0.254 206
Relative edge distribution entropy Her =0.761 733
Power law exponent γ =3.005 98
Tail power law exponent γt =2.261 00
Tail power law exponent with p γ3 =2.261 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.721 00
Left p-value p1 =0.328 000
Right tail power law exponent with p γ3,2 =4.521 00
Right p-value p2 =0.268 000
Degree assortativity ρ =−0.359 040
Degree assortativity p-value pρ =7.474 43 × 10−156
Spectral norm α =451.312
Algebraic connectivity a =0.046 502 2
Spectral separation 1[A] / λ2[A]| =2.079 98
Controllability C =2,194
Relative controllability Cr =0.803 663


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.