Wikivoyage edits (he)

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


Internal nameedit-hewikivoyage
NameWikivoyage edits (he)
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 =13,272
Left size n1 =1,063
Right size n2 =12,209
Volume m =137,890
Unique edge count m̿ =27,467
Wedge count s =53,439,465
Claw count z =148,351,660,521
Cross count x =338,471,556,636,020
Square count q =5,536,376
4-Tour count T4 =258,151,686
Maximum degree dmax =84,941
Maximum left degree d1max =84,941
Maximum right degree d2max =2,475
Average degree d =20.779 1
Average left degree d1 =129.718
Average right degree d2 =11.294 1
Fill p =0.002 116 40
Average edge multiplicity m̃ =5.020 21
Size of LCC N =13,133
Diameter δ =10
50-Percentile effective diameter δ0.5 =1.962 35
90-Percentile effective diameter δ0.9 =3.765 05
Median distance δM =2
Mean distance δm =2.858 83
Gini coefficient G =0.873 263
Balanced inequality ratio P =0.136 518
Left balanced inequality ratio P1 =0.052 056 0
Right balanced inequality ratio P2 =0.178 171
Relative edge distribution entropy Her =0.726 351
Power law exponent γ =3.019 47
Tail power law exponent γt =2.321 00
Tail power law exponent with p γ3 =2.321 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.671 00
Left p-value p1 =0.736 000
Right tail power law exponent with p γ3,2 =2.521 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.303 222
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,720.48
Algebraic connectivity a =0.132 800
Spectral separation 1[A] / λ2[A]| =3.978 26
Controllability C =11,953
Relative controllability Cr =0.900 754


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.