Wiktionary edits (si)

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

Metadata

Codemsi
Internal nameedit-siwiktionary
NameWiktionary edits (si)
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 =3,016
Left size n1 =232
Right size n2 =2,784
Volume m =11,439
Unique edge count m̿ =6,263
Wedge count s =1,923,427
Claw count z =778,859,448
Cross count x =287,658,336,183
Square count q =766,073
4-Tour count T4 =13,835,126
Maximum degree dmax =2,700
Maximum left degree d1max =2,700
Maximum right degree d2max =113
Average degree d =7.585 54
Average left degree d1 =49.306 0
Average right degree d2 =4.108 84
Fill p =0.009 696 73
Average edge multiplicity m̃ =1.826 44
Size of LCC N =2,673
Diameter δ =16
50-Percentile effective diameter δ0.5 =3.084 60
90-Percentile effective diameter δ0.9 =5.959 90
Median distance δM =4
Mean distance δm =3.693 98
Gini coefficient G =0.773 615
Relative edge distribution entropy Her =0.757 608
Power law exponent γ =2.791 03
Tail power law exponent γt =2.011 00
Degree assortativity ρ =−0.323 530
Degree assortativity p-value pρ =1.492 42 × 10−152
Spectral norm α =134.970
Algebraic connectivity a =0.007 856 83

Plots

Fruchterman–Reingold graph drawing

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

Double Laplacian graph drawing

Delaunay graph drawing

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.