Wiktionary edits (la)

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

Metadata

Codemla
Internal nameedit-lawiktionary
NameWiktionary edits (la)
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 =30,656
Left size n1 =839
Right size n2 =29,817
Volume m =177,936
Unique edge count m̿ =100,159
Wedge count s =373,348,567
Claw count z =1,345,464,005,266
Cross count x =4,145,892,594,711,256
Square count q =321,142,448
4-Tour count T4 =4,062,772,186
Maximum degree dmax =20,101
Maximum left degree d1max =20,101
Maximum right degree d2max =500
Average degree d =11.608 6
Average left degree d1 =212.081
Average right degree d2 =5.967 60
Fill p =0.004 003 72
Average edge multiplicity m̃ =1.776 54
Size of LCC N =30,245
Diameter δ =12
50-Percentile effective diameter δ0.5 =2.390 69
90-Percentile effective diameter δ0.9 =3.848 23
Median distance δM =3
Mean distance δm =3.041 98
Gini coefficient G =0.796 532
Balanced inequality ratio P =0.180 576
Left balanced inequality ratio P1 =0.041 312 6
Right balanced inequality ratio P2 =0.261 375
Relative edge distribution entropy Her =0.699 901
Power law exponent γ =2.165 75
Tail power law exponent γt =1.501 00
Degree assortativity ρ =−0.349 610
Degree assortativity p-value pρ =0.000 00
Spectral norm α =571.915
Algebraic connectivity a =0.027 809 3

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

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.