Wikiquote edits (bm)

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

Metadata

Codeqbm
Internal nameedit-bmwikiquote
NameWikiquote 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 =84
Left size n1 =28
Right size n2 =56
Volume m =77
Unique edge count m̿ =65
Wedge count s =94
Claw count z =107
Cross count x =97
Square count q =4
4-Tour count T4 =554
Maximum degree dmax =8
Maximum left degree d1max =8
Maximum right degree d2max =7
Average degree d =1.833 33
Average left degree d1 =2.750 00
Average right degree d2 =1.375 00
Fill p =0.041 454 1
Average edge multiplicity m̃ =1.184 62
Size of LCC N =11
Diameter δ =4
50-Percentile effective diameter δ0.5 =1.945 95
90-Percentile effective diameter δ0.9 =3.587 50
Median distance δM =2
Mean distance δm =2.409 09
Gini coefficient G =0.410 482
Balanced inequality ratio P =0.337 662
Left balanced inequality ratio P1 =0.311 688
Right balanced inequality ratio P2 =0.415 584
Relative edge distribution entropy Her =0.952 964
Power law exponent γ =4.674 13
Tail power law exponent γt =2.551 00
Tail power law exponent with p γ3 =2.551 00
p-value p =0.373 000
Left tail power law exponent with p γ3,1 =2.641 00
Left p-value p1 =0.528 000
Right tail power law exponent with p γ3,2 =3.511 00
Right p-value p2 =0.511 000
Degree assortativity ρ =−0.048 110 0
Degree assortativity p-value pρ =0.703 523
Spectral norm α =4.745 29
Algebraic connectivity a =0.387 754
Spectral separation |λ1[A] / λ2[A]| =1.163 31
Controllability C =30
Relative controllability Cr =0.357 143

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

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.