Wiktionary edits (ja)

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

Metadata

Codemja
Internal nameedit-jawiktionary
NameWiktionary edits (ja)
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 =210,706
Left size n1 =2,510
Right size n2 =208,196
Volume m =949,700
Unique edge count m̿ =630,227
Wedge count s =11,641,656,122
Claw count z =249,319,884,009,301
Cross count x =4,813,755,297,545,241,600
Square count q =4,353,620,268
4-Tour count T4 =81,396,882,950
Maximum degree dmax =127,715
Maximum left degree d1max =127,715
Maximum right degree d2max =751
Average degree d =9.014 46
Average left degree d1 =378.367
Average right degree d2 =4.561 57
Fill p =0.001 206 01
Average edge multiplicity m̃ =1.506 92
Size of LCC N =209,038
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.042 29
90-Percentile effective diameter δ0.9 =3.855 20
Median distance δM =4
Mean distance δm =3.103 56
Gini coefficient G =0.768 802
Balanced inequality ratio P =0.197 974
Left balanced inequality ratio P1 =0.030 265 3
Right balanced inequality ratio P2 =0.296 432
Relative edge distribution entropy Her =0.688 472
Power law exponent γ =2.215 41
Tail power law exponent γt =1.481 00
Degree assortativity ρ =−0.291 160
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,030.96
Algebraic connectivity a =0.035 478 2

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.