Wiktionary edits (ak)

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

Metadata

Codemak
Internal nameedit-akwiktionary
NameWiktionary edits (ak)
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 =119
Left size n1 =40
Right size n2 =79
Volume m =100
Unique edge count m̿ =87
Wedge count s =138
Claw count z =263
Cross count x =422
Square count q =4
4-Tour count T4 =798
Maximum degree dmax =14
Maximum left degree d1max =14
Maximum right degree d2max =4
Average degree d =1.680 67
Average left degree d1 =2.500 00
Average right degree d2 =1.265 82
Fill p =0.027 531 6
Average edge multiplicity m̃ =1.149 43
Size of LCC N =14
Diameter δ =4
50-Percentile effective diameter δ0.5 =1.430 23
90-Percentile effective diameter δ0.9 =2.385 00
Median distance δM =2
Mean distance δm =1.881 77
Gini coefficient G =0.402 532
Balanced inequality ratio P =0.345 000
Left balanced inequality ratio P1 =0.310 000
Right balanced inequality ratio P2 =0.430 000
Relative edge distribution entropy Her =0.950 984
Power law exponent γ =5.514 86
Tail power law exponent γt =2.731 00
Tail power law exponent with p γ3 =2.731 00
p-value p =0.898 000
Left tail power law exponent with p γ3,1 =2.531 00
Left p-value p1 =0.809 000
Right tail power law exponent with p γ3,2 =3.801 00
Right p-value p2 =0.368 000
Degree assortativity ρ =+0.045 415 1
Degree assortativity p-value pρ =0.676 172
Spectral norm α =4.690 92
Algebraic connectivity a =0.316 929
Spectral separation |λ1[A] / λ2[A]| =1.137 72
Controllability C =40
Relative controllability Cr =0.338 983

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 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.