Wiktionary edits (roa-rup)

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


Internal nameedit-roa_rupwiktionary
NameWiktionary edits (roa-rup)
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 =2,137
Left size n1 =174
Right size n2 =1,963
Volume m =8,738
Unique edge count m̿ =5,406
Wedge count s =1,890,621
Claw count z =659,147,523
Cross count x =192,000,791,134
Square count q =1,508,159
4-Tour count T4 =19,638,568
Maximum degree dmax =1,873
Maximum left degree d1max =1,873
Maximum right degree d2max =91
Average degree d =8.177 82
Average left degree d1 =50.218 4
Average right degree d2 =4.451 35
Fill p =0.015 827 3
Average edge multiplicity m̃ =1.616 35
Size of LCC N =1,815
Diameter δ =14
50-Percentile effective diameter δ0.5 =1.736 57
90-Percentile effective diameter δ0.9 =7.550 95
Median distance δM =2
Mean distance δm =3.507 91
Gini coefficient G =0.718 104
Balanced inequality ratio P =0.232 090
Left balanced inequality ratio P1 =0.084 802 0
Right balanced inequality ratio P2 =0.321 469
Relative edge distribution entropy Her =0.746 562
Power law exponent γ =2.262 20
Tail power law exponent γt =3.391 00
Tail power law exponent with p γ3 =3.391 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.631 00
Left p-value p1 =0.123 000
Right tail power law exponent with p γ3,2 =4.271 00
Right p-value p2 =0.003 000 00
Degree assortativity ρ =−0.148 853
Degree assortativity p-value pρ =3.684 37 × 10−28
Spectral norm α =112.840
Algebraic connectivity a =0.003 023 99
Spectral separation 1[A] / λ2[A]| =1.228 09
Controllability C =1,797
Relative controllability Cr =0.843 266


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.