Wiktionary edits (xh)

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

Metadata

Codemxh
Internal nameedit-xhwiktionary
NameWiktionary edits (xh)
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 =141
Left size n1 =38
Right size n2 =103
Volume m =147
Unique edge count m̿ =117
Wedge count s =447
Claw count z =1,692
Cross count x =5,659
Square count q =121
4-Tour count T4 =2,994
Maximum degree dmax =34
Maximum left degree d1max =34
Maximum right degree d2max =8
Average degree d =2.085 11
Average left degree d1 =3.868 42
Average right degree d2 =1.427 18
Fill p =0.029 892 7
Average edge multiplicity m̃ =1.256 41
Size of LCC N =28
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.777 55
90-Percentile effective diameter δ0.9 =5.019 12
Median distance δM =3
Mean distance δm =3.384 44
Gini coefficient G =0.463 616
Balanced inequality ratio P =0.329 932
Left balanced inequality ratio P1 =0.272 109
Right balanced inequality ratio P2 =0.367 347
Relative edge distribution entropy Her =0.921 476
Power law exponent γ =3.742 80
Tail power law exponent γt =2.311 00
Tail power law exponent with p γ3 =2.311 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =2.361 00
Left p-value p1 =0.725 000
Right tail power law exponent with p γ3,2 =5.631 00
Right p-value p2 =0.032 000 0
Degree assortativity ρ =−0.018 669 1
Degree assortativity p-value pρ =0.841 647
Spectral norm α =9.045 00
Algebraic connectivity a =0.076 655 0
Spectral separation |λ1[A] / λ2[A]| =1.926 32
Controllability C =55
Relative controllability Cr =0.440 000

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

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.