Wiktionary edits (rm)

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


Internal nameedit-rmwiktionary
NameWiktionary edits (rm)
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 =142
Left size n1 =20
Right size n2 =122
Volume m =156
Unique edge count m̿ =138
Wedge count s =2,817
Claw count z =65,184
Cross count x =1,151,139
Square count q =24
4-Tour count T4 =12,028
Maximum degree dmax =74
Maximum left degree d1max =74
Maximum right degree d2max =6
Average degree d =2.197 18
Average left degree d1 =7.800 00
Average right degree d2 =1.278 69
Fill p =0.056 557 4
Average edge multiplicity m̃ =1.130 43
Size of LCC N =74
Diameter δ =2
50-Percentile effective diameter δ0.5 =1.479 74
90-Percentile effective diameter δ0.9 =1.895 95
Median distance δM =2
Mean distance δm =1.948 18
Gini coefficient G =0.543 296
Balanced inequality ratio P =0.282 051
Left balanced inequality ratio P1 =0.205 128
Right balanced inequality ratio P2 =0.435 897
Relative edge distribution entropy Her =0.808 936
Power law exponent γ =5.753 90
Tail power law exponent γt =2.771 00
Tail power law exponent with p γ3 =2.771 00
p-value p =0.157 000
Left tail power law exponent with p γ3,1 =1.691 00
Left p-value p1 =0.304 000
Right tail power law exponent with p γ3,2 =3.711 00
Right p-value p2 =0.425 000
Degree assortativity ρ =−0.477 479
Degree assortativity p-value pρ =3.190 31 × 10−9
Spectral norm α =8.602 33
Spectral separation 1[A] / λ2[A]| =1.332 17
Controllability C =102
Relative controllability Cr =0.718 310


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

Inter-event 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.