Wiktionary edits (av)

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

Metadata

Codemav
Internal nameedit-avwiktionary
NameWiktionary edits (av)
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 =107
Left size n1 =35
Right size n2 =72
Volume m =100
Unique edge count m̿ =86
Wedge count s =142
Claw count z =195
Cross count x =209
Square count q =13
4-Tour count T4 =880
Maximum degree dmax =11
Maximum left degree d1max =11
Maximum right degree d2max =3
Average degree d =1.869 16
Average left degree d1 =2.857 14
Average right degree d2 =1.388 89
Fill p =0.034 127 0
Average edge multiplicity m̃ =1.162 79
Size of LCC N =15
Diameter δ =6
50-Percentile effective diameter δ0.5 =2.215 69
90-Percentile effective diameter δ0.9 =3.891 80
Median distance δM =3
Mean distance δm =2.724 58
Gini coefficient G =0.412 917
Balanced inequality ratio P =0.345 000
Left balanced inequality ratio P1 =0.300 000
Right balanced inequality ratio P2 =0.410 000
Relative edge distribution entropy Her =0.950 028
Power law exponent γ =4.424 93
Tail power law exponent γt =2.491 00
Tail power law exponent with p γ3 =2.491 00
p-value p =0.234 000
Left tail power law exponent with p γ3,1 =1.941 00
Left p-value p1 =0.050 000 0
Right tail power law exponent with p γ3,2 =6.881 00
Right p-value p2 =0.856 000
Degree assortativity ρ =+0.165 911
Degree assortativity p-value pρ =0.126 840
Spectral norm α =5.099 80
Algebraic connectivity a =0.182 941
Spectral separation |λ1[A] / λ2[A]| =1.099 17
Controllability C =39
Relative controllability Cr =0.364 486

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

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.