Wiktionary edits (bh)

This is the bipartite edit network of the भोजपुरी Wiktionary. It contains users and pages from the भोजपुरी Wiktionary, connected by edit events. Each edge represents an edit. The dataset includes the timestamp of each edit.


Internal nameedit-bhwiktionary
NameWiktionary edits (bh)
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 =268
Left size n1 =38
Right size n2 =230
Volume m =289
Unique edge count m̿ =247
Wedge count s =5,807
Claw count z =141,131
Cross count x =2,577,284
Square count q =17
4-Tour count T4 =24,166
Maximum degree dmax =78
Maximum left degree d1max =78
Maximum right degree d2max =9
Average degree d =2.156 72
Average left degree d1 =7.605 26
Average right degree d2 =1.256 52
Fill p =0.028 260 9
Average edge multiplicity m̃ =1.170 04
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.544 306
Balanced inequality ratio P =0.282 007
Left balanced inequality ratio P1 =0.228 374
Right balanced inequality ratio P2 =0.439 446
Relative edge distribution entropy Her =0.818 899
Power law exponent γ =7.030 81
Tail power law exponent γt =2.991 00
Tail power law exponent with p γ3 =2.991 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =2.021 00
Left p-value p1 =0.342 000
Right tail power law exponent with p γ3,2 =4.441 00
Right p-value p2 =0.799 000
Degree assortativity ρ =−0.379 890
Degree assortativity p-value pρ =6.694 84 × 10−10
Spectral norm α =9.916 37
Controllability C =194
Relative controllability Cr =0.723 881


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.