Wiktionary edits (sm)

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


Internal nameedit-smwiktionary
NameWiktionary edits (sm)
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 =8,552
Left size n1 =190
Right size n2 =8,362
Volume m =57,815
Unique edge count m̿ =34,589
Wedge count s =100,509,103
Claw count z =225,869,706,218
Cross count x =394,326,277,418,418
Square count q =133,541,105
4-Tour count T4 =1,470,434,738
Maximum degree dmax =15,603
Maximum left degree d1max =15,603
Maximum right degree d2max =51
Average degree d =13.520 8
Average left degree d1 =304.289
Average right degree d2 =6.914 02
Fill p =0.021 770 8
Average edge multiplicity m̃ =1.671 49
Size of LCC N =8,170
Diameter δ =16
50-Percentile effective diameter δ0.5 =1.571 29
90-Percentile effective diameter δ0.9 =3.458 37
Median distance δM =2
Mean distance δm =2.434 59
Gini coefficient G =0.648 745
Balanced inequality ratio P =0.268 512
Left balanced inequality ratio P1 =0.034 558 5
Right balanced inequality ratio P2 =0.384 589
Relative edge distribution entropy Her =0.685 900
Power law exponent γ =1.745 90
Tail power law exponent γt =5.851 00
Tail power law exponent with p γ3 =5.851 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.601 00
Left p-value p1 =0.074 000 0
Right tail power law exponent with p γ3,2 =8.991 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.209 317
Degree assortativity p-value pρ =0.000 00
Algebraic connectivity a =0.004 344 54
Controllability C =8,108
Relative controllability Cr =0.956 132


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.