Wiktionary edits (ms)

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


Internal nameedit-mswiktionary
NameWiktionary edits (ms)
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 =9,234
Left size n1 =408
Right size n2 =8,826
Volume m =98,528
Unique edge count m̿ =19,918
Wedge count s =17,710,029
Claw count z =17,011,340,886
Cross count x =14,835,576,655,179
Square count q =6,949,665
4-Tour count T4 =126,477,640
Maximum degree dmax =65,166
Maximum left degree d1max =65,166
Maximum right degree d2max =3,144
Average degree d =21.340 3
Average left degree d1 =241.490
Average right degree d2 =11.163 4
Fill p =0.005 531 23
Average edge multiplicity m̃ =4.946 68
Size of LCC N =8,811
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.278 83
90-Percentile effective diameter δ0.9 =3.973 76
Median distance δM =4
Mean distance δm =3.489 62
Gini coefficient G =0.883 308
Balanced inequality ratio P =0.133 906
Left balanced inequality ratio P1 =0.036 071 0
Right balanced inequality ratio P2 =0.196 624
Relative edge distribution entropy Her =0.723 652
Power law exponent γ =2.756 21
Tail power law exponent γt =2.001 00
Tail power law exponent with p γ3 =2.001 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.691 00
Left p-value p1 =0.010 000 0
Right tail power law exponent with p γ3,2 =5.651 00
Right p-value p2 =0.011 000 0
Degree assortativity ρ =−0.261 416
Degree assortativity p-value pρ =1.618 44 × 10−308
Algebraic connectivity a =0.062 955 4
Spectral separation 1[A] / λ2[A]| =24.551 2
Controllability C =8,242
Relative controllability Cr =0.917 000


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.