Wiktionary edits (el)

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

Metadata

Codemel
Internal nameedit-elwiktionary
NameWiktionary edits (el)
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 =481,016
Left size n1 =2,867
Right size n2 =478,149
Volume m =3,826,713
Unique edge count m̿ =1,482,567
Wedge count s =154,000,034,217
Claw count z =16,528,716,756,141,926
Cross count x =1.452 11 × 1021
Maximum degree dmax =1,398,956
Maximum left degree d1max =1,398,956
Maximum right degree d2max =1,864
Average degree d =15.911 0
Average left degree d1 =1,334.74
Average right degree d2 =8.003 18
Fill p =0.001 081 49
Average edge multiplicity m̃ =2.581 14
Size of LCC N =474,813
Diameter δ =12
50-Percentile effective diameter δ0.5 =1.614 70
90-Percentile effective diameter δ0.9 =3.407 36
Median distance δM =2
Mean distance δm =2.356 38
Gini coefficient G =0.731 858
Balanced inequality ratio P =0.229 510
Left balanced inequality ratio P1 =0.013 501 4
Right balanced inequality ratio P2 =0.331 616
Relative edge distribution entropy Her =0.646 564
Power law exponent γ =2.085 65
Tail power law exponent with p γ3 =4.681 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.631 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =6.621 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.364 531
Degree assortativity p-value pρ =0.000 00
Spectral norm α =3,525.88
Algebraic connectivity a =0.054 206 4
Spectral separation |λ1[A] / λ2[A]| =1.771 55
Controllability C =470,687
Relative controllability Cr =0.990 626

Plots

Degree distribution

Cumulative degree distribution

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

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.