Wikivoyage edits (fa)

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


Internal nameedit-fawikivoyage
NameWikivoyage edits (fa)
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 =20,349
Left size n1 =1,269
Right size n2 =19,080
Volume m =85,549
Unique edge count m̿ =40,701
Wedge count s =107,753,460
Claw count z =308,958,619,110
Cross count x =725,676,752,008,693
Square count q =31,602,370
4-Tour count T4 =684,007,682
Maximum degree dmax =24,758
Maximum left degree d1max =24,758
Maximum right degree d2max =495
Average degree d =8.408 18
Average left degree d1 =67.414 5
Average right degree d2 =4.483 70
Fill p =0.001 680 99
Average edge multiplicity m̃ =2.101 89
Size of LCC N =20,129
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.705 43
90-Percentile effective diameter δ0.9 =3.970 24
Median distance δM =3
Mean distance δm =3.164 89
Gini coefficient G =0.768 658
Balanced inequality ratio P =0.206 063
Left balanced inequality ratio P1 =0.061 637 2
Right balanced inequality ratio P2 =0.302 809
Relative edge distribution entropy Her =0.704 178
Power law exponent γ =2.879 30
Tail power law exponent γt =2.741 00
Degree assortativity ρ =−0.309 058
Degree assortativity p-value pρ =0.000 00
Spectral norm α =547.585
Algebraic connectivity a =0.055 621 6
Spectral separation 1[A] / λ2[A]| =1.199 50
Controllability C =18,622
Relative controllability Cr =0.916 437


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

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.