Wiktionary edits (de)

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

Metadata

Codemde
Internal nameedit-dewiktionary
NameWiktionary edits (de)
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 =725,085
Left size n1 =12,104
Right size n2 =712,981
Volume m =5,776,013
Unique edge count m̿ =3,451,327
Wedge count s =227,306,280,974
Claw count z =120,475,984,847,508
Cross count x =1,528,069,040,096,599,040
Square count q =7,023,812,795
4-Tour count T4 =89,606,310,540
Maximum degree dmax =1,419,697
Maximum left degree d1max =1,419,697
Maximum right degree d2max =13,425
Average degree d =15.932 0
Average left degree d1 =477.199
Average right degree d2 =8.101 22
Fill p =0.000 807 324
Average edge multiplicity m̃ =1.789 11
Size of LCC N =717,413
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.000 19
90-Percentile effective diameter δ0.9 =3.828 70
Median distance δM =4
Mean distance δm =3.041 21
Gini coefficient G =0.770 698
Balanced inequality ratio P =0.188 683
Left balanced inequality ratio P1 =0.018 734 5
Right balanced inequality ratio P2 =0.278 198
Relative edge distribution entropy Her =0.719 119
Power law exponent γ =1.822 77
Tail power law exponent γt =3.451 00
Degree assortativity ρ =−0.202 046
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,797.35
Algebraic connectivity a =0.060 730 2
Spectral separation 1[A] / λ2[A]| =1.281 32
Controllability C =140,788

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

Inter-event distribution

Node-level inter-event distribution

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.