Wiktionary edits (kw)

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

Metadata

Codemkw
Internal nameedit-kwwiktionary
NameWiktionary edits (kw)
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 =1,245
Left size n1 =186
Right size n2 =1,059
Volume m =6,895
Unique edge count m̿ =3,368
Wedge count s =476,069
Claw count z =63,124,236
Cross count x =7,080,329,549
Square count q =631,527
4-Tour count T4 =6,965,404
Maximum degree dmax =1,439
Maximum left degree d1max =1,439
Maximum right degree d2max =120
Average degree d =11.076 3
Average left degree d1 =37.069 9
Average right degree d2 =6.510 86
Fill p =0.017 098 7
Average edge multiplicity m̃ =2.047 21
Size of LCC N =1,027
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.713 73
90-Percentile effective diameter δ0.9 =7.085 36
Median distance δM =4
Mean distance δm =4.437 21
Gini coefficient G =0.731 908
Relative edge distribution entropy Her =0.782 975
Power law exponent γ =2.171 53
Tail power law exponent γt =3.191 00
Degree assortativity ρ =+0.223 264
Degree assortativity p-value pρ =2.593 76 × 10−39
Spectral norm α =137.238
Algebraic connectivity a =0.011 037 6

Plots

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

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.