Wiktionary edits (simple)

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

Metadata

Codemsimple
Internal nameedit-simplewiktionary
NameWiktionary edits (simple)
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 =33,632
Left size n1 =1,750
Right size n2 =31,882
Volume m =400,482
Unique edge count m̿ =181,862
Wedge count s =892,366,405
Claw count z =5,415,807,688,219
Cross count x =29,230,545,611,502,492
Square count q =1,091,715,740
4-Tour count T4 =12,303,678,660
Maximum degree dmax =131,277
Maximum left degree d1max =131,277
Maximum right degree d2max =2,142
Average degree d =23.815 5
Average left degree d1 =228.847
Average right degree d2 =12.561 4
Fill p =0.003 259 56
Average edge multiplicity m̃ =2.202 12
Size of LCC N =33,178
Diameter δ =11
50-Percentile effective diameter δ0.5 =1.833 40
90-Percentile effective diameter δ0.9 =3.762 68
Median distance δM =2
Mean distance δm =2.755 51
Gini coefficient G =0.728 535
Balanced inequality ratio P =0.229 241
Left balanced inequality ratio P1 =0.044 036 9
Right balanced inequality ratio P2 =0.331 104
Relative edge distribution entropy Her =0.734 015
Power law exponent γ =1.685 35
Tail power law exponent γt =2.971 00
Degree assortativity ρ =−0.170 115
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,133.95
Algebraic connectivity a =0.083 138 0

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

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.