Wiktionary edits (an)

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

Metadata

Codeman
Internal nameedit-anwiktionary
NameWiktionary edits (an)
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 =6,101
Left size n1 =302
Right size n2 =5,799
Volume m =25,735
Unique edge count m̿ =14,275
Wedge count s =9,130,103
Claw count z =5,914,118,472
Cross count x =3,165,330,941,061
Square count q =4,623,120
4-Tour count T4 =73,559,286
Maximum degree dmax =4,200
Maximum left degree d1max =4,200
Maximum right degree d2max =164
Average degree d =8.436 32
Average left degree d1 =85.215 2
Average right degree d2 =4.437 83
Fill p =0.008 151 10
Average edge multiplicity m̃ =1.802 80
Size of LCC N =5,793
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.229 03
90-Percentile effective diameter δ0.9 =5.590 63
Median distance δM =4
Mean distance δm =3.654 06
Gini coefficient G =0.769 685
Balanced inequality ratio P =0.202 662
Left balanced inequality ratio P1 =0.070 837 4
Right balanced inequality ratio P2 =0.290 849
Relative edge distribution entropy Her =0.735 813
Power law exponent γ =2.538 31
Tail power law exponent γt =2.851 00
Tail power law exponent with p γ3 =2.851 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.611 00
Left p-value p1 =0.005 000 00
Right tail power law exponent with p γ3,2 =8.991 00
Right p-value p2 =0.719 000
Degree assortativity ρ =−0.300 769
Degree assortativity p-value pρ =2.961 45 × 10−296
Spectral norm α =199.453
Spectral separation 1[A] / λ2[A]| =1.407 64
Controllability C =5,503
Relative controllability Cr =0.904 355

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.