Wiktionary edits (mh)

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


Internal nameedit-mhwiktionary
NameWiktionary edits (mh)
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 =83
Left size n1 =29
Right size n2 =54
Volume m =92
Unique edge count m̿ =67
Wedge count s =110
Claw count z =147
Cross count x =153
Square count q =3
4-Tour count T4 =626
Maximum degree dmax =21
Maximum left degree d1max =11
Maximum right degree d2max =21
Average degree d =2.216 87
Average left degree d1 =3.172 41
Average right degree d2 =1.703 70
Fill p =0.042 784 2
Average edge multiplicity m̃ =1.373 13
Size of LCC N =33
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.451 09
90-Percentile effective diameter δ0.9 =5.991 62
Median distance δM =4
Mean distance δm =4.051 03
Gini coefficient G =0.481 683
Balanced inequality ratio P =0.304 348
Left balanced inequality ratio P1 =0.304 348
Right balanced inequality ratio P2 =0.369 565
Relative edge distribution entropy Her =0.947 459
Power law exponent γ =4.382 71
Tail power law exponent γt =2.481 00
Tail power law exponent with p γ3 =2.481 00
p-value p =0.363 000
Left tail power law exponent with p γ3,1 =4.341 00
Left p-value p1 =0.480 000
Right tail power law exponent with p γ3,2 =3.401 00
Right p-value p2 =0.574 000
Degree assortativity ρ =−0.088 516 8
Degree assortativity p-value pρ =0.476 275
Spectral norm α =11.093 6
Algebraic connectivity a =0.078 662 0
Spectral separation 1[A] / λ2[A]| =2.145 14
Controllability C =25
Relative controllability Cr =0.301 205


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

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.