Wiktionary edits (bn)

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

Metadata

Codembn
Internal nameedit-bnwiktionary
NameWiktionary edits (bn)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
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

Statistics

Size n =10,258
Left size n1 =456
Right size n2 =9,802
Volume m =36,040
Unique edge count m̿ =20,002
Wedge count s =20,497,931
Claw count z =31,233,257,680
Cross count x =42,051,396,318,835
Square count q =3,632,880
4-Tour count T4 =111,095,092
Maximum degree dmax =15,585
Maximum left degree d1max =15,585
Maximum right degree d2max =547
Average degree d =7.026 71
Average left degree d1 =79.035 1
Average right degree d2 =3.676 80
Fill p =0.004 475 01
Average edge multiplicity m̃ =1.801 82
Size of LCC N =9,895
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.373 96
90-Percentile effective diameter δ0.9 =5.463 22
Median distance δM =4
Mean distance δm =3.777 72
Gini coefficient G =0.718 827
Balanced inequality ratio P =0.236 349
Left balanced inequality ratio P1 =0.074 112 1
Right balanced inequality ratio P2 =0.326 332
Relative edge distribution entropy Her =0.737 598
Power law exponent γ =2.892 59
Tail power law exponent γt =2.681 00
Tail power law exponent with p γ3 =2.681 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.601 00
Left p-value p1 =0.820 000
Right tail power law exponent with p γ3,2 =5.681 00
Right p-value p2 =0.101 000
Degree assortativity ρ =−0.251 213
Degree assortativity p-value pρ =1.760 04 × 10−285
Algebraic connectivity a =0.007 800 46
Controllability C =9,331
Relative controllability Cr =0.914 535

Plots

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

Downloads

References

[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.