Wiktionary edits (gu)

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


Internal nameedit-guwiktionary
NameWiktionary edits (gu)
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 =4,214
Left size n1 =274
Right size n2 =3,940
Volume m =13,905
Unique edge count m̿ =7,662
Wedge count s =2,090,613
Claw count z =528,559,027
Cross count x =110,543,479,040
Square count q =1,111,682
4-Tour count T4 =17,275,228
Maximum degree dmax =2,045
Maximum left degree d1max =2,045
Maximum right degree d2max =168
Average degree d =6.599 43
Average left degree d1 =50.748 2
Average right degree d2 =3.529 19
Fill p =0.007 097 34
Average edge multiplicity m̃ =1.814 80
Size of LCC N =3,763
Diameter δ =15
50-Percentile effective diameter δ0.5 =3.881 00
90-Percentile effective diameter δ0.9 =6.530 73
Median distance δM =4
Mean distance δm =4.757 94
Gini coefficient G =0.795 826
Balanced inequality ratio P =0.167 494
Left balanced inequality ratio P1 =0.078 029 5
Right balanced inequality ratio P2 =0.246 242
Relative edge distribution entropy Her =0.750 435
Power law exponent γ =3.275 60
Tail power law exponent γt =2.181 00
Tail power law exponent with p γ3 =2.181 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.541 00
Left p-value p1 =0.306 000
Right tail power law exponent with p γ3,2 =8.281 00
Right p-value p2 =0.067 000 0
Degree assortativity ρ =−0.344 426
Degree assortativity p-value pρ =2.395 46 × 10−212
Spectral norm α =179.993
Spectral separation 1[A] / λ2[A]| =1.222 21
Controllability C =3,519
Relative controllability Cr =0.872 551


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.