Wiktionary edits (bm)

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

Metadata

Codembm
Internal nameedit-bmwiktionary
NameWiktionary edits (bm)
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 =33
Right size n2 =86
Volume m =179
Unique edge count m̿ =134
Wedge count s =913
Claw count z =6,226
Cross count x =36,038
Square count q =258
4-Tour count T4 =6,008
Maximum degree dmax =50
Maximum left degree d1max =50
Maximum right degree d2max =17
Average degree d =3.008 40
Average left degree d1 =5.424 24
Average right degree d2 =2.081 40
Fill p =0.047 216 3
Average edge multiplicity m̃ =1.335 82
Size of LCC N =81
Diameter δ =10
50-Percentile effective diameter δ0.5 =4.020 96
90-Percentile effective diameter δ0.9 =6.004 07
Median distance δM =5
Mean distance δm =4.388 24
Gini coefficient G =0.519 878
Balanced inequality ratio P =0.307 263
Left balanced inequality ratio P1 =0.268 156
Right balanced inequality ratio P2 =0.363 128
Relative edge distribution entropy Her =0.894 962
Power law exponent γ =3.077 49
Tail power law exponent γt =2.391 00
Degree assortativity ρ =−0.172 605
Degree assortativity p-value pρ =0.046 116 3
Spectral norm α =11.103 6
Algebraic connectivity a =0.046 678 9
Controllability C =55
Relative controllability Cr =0.462 185

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.