Wiktionary edits (dz)

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


Internal nameedit-dzwiktionary
NameWiktionary edits (dz)
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 =260
Left size n1 =31
Right size n2 =229
Volume m =274
Unique edge count m̿ =254
Wedge count s =6,167
Claw count z =143,435
Cross count x =2,586,440
Square count q =81
4-Tour count T4 =26,132
Maximum degree dmax =78
Maximum left degree d1max =78
Maximum right degree d2max =6
Average degree d =2.107 69
Average left degree d1 =8.838 71
Average right degree d2 =1.196 51
Fill p =0.035 779 7
Average edge multiplicity m̃ =1.078 74
Size of LCC N =78
Diameter δ =2
50-Percentile effective diameter δ0.5 =1.481 26
90-Percentile effective diameter δ0.9 =1.896 25
Median distance δM =2
Mean distance δm =1.952 09
Gini coefficient G =0.542 355
Balanced inequality ratio P =0.291 971
Left balanced inequality ratio P1 =0.167 883
Right balanced inequality ratio P2 =0.448 905
Relative edge distribution entropy Her =0.804 836
Power law exponent γ =6.733 58
Tail power law exponent γt =2.951 00
Tail power law exponent with p γ3 =2.951 00
p-value p =0.021 000 0
Left tail power law exponent with p γ3,1 =1.731 00
Left p-value p1 =0.524 000
Right tail power law exponent with p γ3,2 =3.821 00
Right p-value p2 =0.074 000 0
Degree assortativity ρ =−0.520 254
Degree assortativity p-value pρ =5.116 20 × 10−19
Spectral norm α =8.831 76
Spectral separation 1[A] / λ2[A]| =1.026 67
Controllability C =203
Relative controllability Cr =0.783 784


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

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.