Wiktionary edits (li)

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

Metadata

Codemli
Internal nameedit-liwiktionary
NameWiktionary edits (li)
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 =120,876
Left size n1 =444
Right size n2 =120,432
Volume m =589,486
Unique edge count m̿ =409,144
Wedge count s =11,867,804,431
Claw count z =366,527,614,949,660
Cross count x =9.702 25 × 1018
Square count q =7,438,406,807
4-Tour count T4 =106,979,436,028
Maximum degree dmax =135,988
Maximum left degree d1max =135,988
Maximum right degree d2max =527
Average degree d =9.753 57
Average left degree d1 =1,327.67
Average right degree d2 =4.894 76
Fill p =0.007 651 58
Average edge multiplicity m̃ =1.440 78
Size of LCC N =120,646
Diameter δ =10
50-Percentile effective diameter δ0.5 =1.522 79
90-Percentile effective diameter δ0.9 =1.941 08
Median distance δM =2
Mean distance δm =2.075 47
Gini coefficient G =0.739 435
Balanced inequality ratio P =0.223 274
Left balanced inequality ratio P1 =0.031 513 9
Right balanced inequality ratio P2 =0.324 837
Relative edge distribution entropy Her =0.655 595
Power law exponent γ =2.039 34
Tail power law exponent γt =4.611 00
Degree assortativity ρ =−0.453 637
Degree assortativity p-value pρ =0.000 00
Spectral norm α =796.334
Algebraic connectivity a =0.083 063 4

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.