Wiktionary edits (ast)

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


Internal nameedit-astwiktionary
NameWiktionary edits (ast)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
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


Size n =22,048
Left size n1 =366
Right size n2 =21,682
Volume m =175,134
Unique edge count m̿ =94,677
Wedge count s =450,997,531
Claw count z =1,965,779,877,144
Cross count x =7,149,644,594,658,656
Square count q =512,109,885
4-Tour count T4 =5,901,202,782
Maximum degree dmax =33,733
Maximum left degree d1max =33,733
Maximum right degree d2max =243
Average degree d =15.886 6
Average left degree d1 =478.508
Average right degree d2 =8.077 39
Fill p =0.011 930 6
Average edge multiplicity m̃ =1.849 81
Size of LCC N =21,794
Diameter δ =10
50-Percentile effective diameter δ0.5 =1.590 74
90-Percentile effective diameter δ0.9 =3.318 56
Median distance δM =2
Mean distance δm =2.307 14
Gini coefficient G =0.734 173
Balanced inequality ratio P =0.223 372
Left balanced inequality ratio P1 =0.035 213 0
Right balanced inequality ratio P2 =0.324 534
Relative edge distribution entropy Her =0.691 569
Power law exponent γ =1.827 97
Tail power law exponent γt =3.831 00
Tail power law exponent with p γ3 =3.831 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.581 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =8.991 00
Right p-value p2 =0.003 000 00
Degree assortativity ρ =−0.443 433
Degree assortativity p-value pρ =0.000 00
Spectral norm α =528.484
Algebraic connectivity a =0.047 533 0
Spectral separation 1[A] / λ2[A]| =1.626 51
Controllability C =21,312
Relative controllability Cr =0.967 935


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



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