Wiktionary edits (rn)

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


Internal nameedit-rnwiktionary
NameWiktionary edits (rn)
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 =89
Left size n1 =27
Right size n2 =62
Volume m =88
Unique edge count m̿ =78
Wedge count s =249
Claw count z =999
Cross count x =3,278
Square count q =6
4-Tour count T4 =1,320
Maximum degree dmax =19
Maximum left degree d1max =19
Maximum right degree d2max =9
Average degree d =1.977 53
Average left degree d1 =3.259 26
Average right degree d2 =1.419 35
Fill p =0.046 595 0
Average edge multiplicity m̃ =1.128 21
Size of LCC N =23
Diameter δ =5
50-Percentile effective diameter δ0.5 =1.614 11
90-Percentile effective diameter δ0.9 =3.181 67
Median distance δM =2
Mean distance δm =2.226 86
Gini coefficient G =0.474 523
Balanced inequality ratio P =0.306 818
Left balanced inequality ratio P1 =0.295 455
Right balanced inequality ratio P2 =0.409 091
Relative edge distribution entropy Her =0.912 718
Power law exponent γ =4.454 25
Tail power law exponent γt =2.501 00
Tail power law exponent with p γ3 =2.501 00
p-value p =0.947 000
Left tail power law exponent with p γ3,1 =2.761 00
Left p-value p1 =0.906 000
Right tail power law exponent with p γ3,2 =3.271 00
Right p-value p2 =0.155 000
Degree assortativity ρ =−0.178 224
Degree assortativity p-value pρ =0.118 489
Spectral norm α =4.732 25
Algebraic connectivity a =0.073 999 9
Spectral separation 1[A] / λ2[A]| =1.013 15
Controllability C =39
Relative controllability Cr =0.438 202


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

Node-level inter-event distribution

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.