Wikivoyage edits (en)

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

Metadata

Codeven
Internal nameedit-enwikivoyage
NameWikivoyage edits (en)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
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

Statistics

Size n =180,704
Left size n1 =45,641
Right size n2 =135,063
Volume m =2,271,834
Unique edge count m̿ =717,367
Wedge count s =3,153,913,551
Claw count z =20,933,161,487,299
Cross count x =127,937,434,015,699,584
Square count q =4,372,744,139
4-Tour count T4 =47,599,355,330
Maximum degree dmax =71,413
Maximum left degree d1max =71,413
Maximum right degree d2max =29,479
Average degree d =25.144 3
Average left degree d1 =49.776 2
Average right degree d2 =16.820 6
Fill p =0.000 116 372
Average edge multiplicity m̃ =3.166 91
Size of LCC N =176,707
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.365 38
90-Percentile effective diameter δ0.9 =4.553 40
Median distance δM =4
Mean distance δm =3.784 04
Gini coefficient G =0.878 524
Balanced inequality ratio P =0.133 376
Left balanced inequality ratio P1 =0.083 584 0
Right balanced inequality ratio P2 =0.157 656
Relative edge distribution entropy Her =0.759 344
Power law exponent γ =2.278 79
Tail power law exponent γt =2.461 00
Degree assortativity ρ =−0.253 485
Degree assortativity p-value pρ =0.000 00
Spectral norm α =6,365.32

Plots

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

Diameter/density evolution

Matrix decompositions plots

Downloads

References

[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. http://dumps.wikimedia.org/, January 2010.