Wikivoyage edits (fr)

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


Internal nameedit-frwikivoyage
NameWikivoyage edits (fr)
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 =25,086
Left size n1 =4,203
Right size n2 =20,883
Volume m =283,080
Unique edge count m̿ =78,100
Wedge count s =108,847,488
Claw count z =229,277,234,338
Cross count x =456,279,776,731,562
Square count q =82,119,274
4-Tour count T4 =1,092,614,308
Maximum degree dmax =55,497
Maximum left degree d1max =55,497
Maximum right degree d2max =3,761
Average degree d =22.568 8
Average left degree d1 =67.351 9
Average right degree d2 =13.555 5
Fill p =0.000 889 813
Average edge multiplicity m̃ =3.624 58
Size of LCC N =24,631
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.211 99
90-Percentile effective diameter δ0.9 =4.501 61
Median distance δM =4
Mean distance δm =3.574 99
Gini coefficient G =0.860 682
Balanced inequality ratio P =0.144 143
Left balanced inequality ratio P1 =0.073 537 5
Right balanced inequality ratio P2 =0.192 984
Relative edge distribution entropy Her =0.755 564
Power law exponent γ =2.349 16
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.891 00
Left p-value p1 =0.006 000 00
Right tail power law exponent with p γ3,2 =2.201 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.280 725
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,833.28
Algebraic connectivity a =0.108 054
Spectral separation 1[A] / λ2[A]| =1.195 74
Controllability C =19,535
Relative controllability Cr =0.783 563


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.