Wiktionary edits (aa)

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

Metadata

Codemaa
Internal nameedit-aawiktionary
NameWiktionary edits (aa)
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 =139
Left size n1 =39
Right size n2 =100
Volume m =171
Unique edge count m̿ =134
Wedge count s =693
Claw count z =3,579
Cross count x =15,663
Square count q =158
4-Tour count T4 =4,340
Maximum degree dmax =39
Maximum left degree d1max =39
Maximum right degree d2max =8
Average degree d =2.460 43
Average left degree d1 =4.384 62
Average right degree d2 =1.710 00
Fill p =0.034 359 0
Average edge multiplicity m̃ =1.276 12
Size of LCC N =32
Diameter δ =5
50-Percentile effective diameter δ0.5 =1.640 00
90-Percentile effective diameter δ0.9 =2.830 30
Median distance δM =2
Mean distance δm =2.215 62
Gini coefficient G =0.482 924
Balanced inequality ratio P =0.321 637
Left balanced inequality ratio P1 =0.257 310
Right balanced inequality ratio P2 =0.368 421
Relative edge distribution entropy Her =0.903 185
Power law exponent γ =3.908 66
Tail power law exponent γt =2.361 00
Tail power law exponent with p γ3 =2.361 00
p-value p =0.012 000 0
Left tail power law exponent with p γ3,1 =1.901 00
Left p-value p1 =0.488 000
Right tail power law exponent with p γ3,2 =5.051 00
Right p-value p2 =0.358 000
Degree assortativity ρ =+0.224 372
Degree assortativity p-value pρ =0.009 153 05
Spectral norm α =9.686 44
Algebraic connectivity a =0.391 140
Spectral separation 1[A] / λ2[A]| =1.374 96
Controllability C =63
Relative controllability Cr =0.453 237

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.