Wikivoyage edits (es)

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


Internal nameedit-eswikivoyage
NameWikivoyage edits (es)
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 =11,473
Left size n1 =2,945
Right size n2 =8,528
Volume m =93,003
Unique edge count m̿ =31,910
Wedge count s =10,120,535
Claw count z =3,807,244,435
Cross count x =1,310,105,415,662
Square count q =11,457,811
4-Tour count T4 =132,242,412
Maximum degree dmax =8,015
Maximum left degree d1max =8,015
Maximum right degree d2max =3,141
Average degree d =16.212 5
Average left degree d1 =31.580 0
Average right degree d2 =10.905 6
Fill p =0.001 270 56
Average edge multiplicity m̃ =2.914 54
Size of LCC N =11,122
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.529 28
90-Percentile effective diameter δ0.9 =4.863 01
Median distance δM =4
Mean distance δm =4.012 73
Gini coefficient G =0.839 061
Balanced inequality ratio P =0.155 705
Left balanced inequality ratio P1 =0.104 868
Right balanced inequality ratio P2 =0.188 865
Relative edge distribution entropy Her =0.790 521
Power law exponent γ =2.511 29
Tail power law exponent γt =1.911 00
Tail power law exponent with p γ3 =1.911 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =2.011 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =4.341 00
Right p-value p2 =0.290 000
Degree assortativity ρ =−0.226 326
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,945.41
Algebraic connectivity a =0.055 111 8
Spectral separation 1[A] / λ2[A]| =3.789 08
Controllability C =8,470
Relative controllability Cr =0.740 773


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.