Wikipedia edits (bn)

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

Metadata

Codebn
Internal nameedit-bnwiki
NameWikipedia 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 =545,404
Left size n1 =22,343
Right size n2 =523,061
Volume m =2,469,893
Unique edge count m̿ =1,399,600
Wedge count s =48,646,969,946
Claw count z =2,862,769,306,239,449
Cross count x =1.459 62 × 1020
Square count q =20,300,587,904
4-Tour count T4 =356,995,573,188
Maximum degree dmax =267,552
Maximum left degree d1max =267,552
Maximum right degree d2max =5,061
Average degree d =9.057 11
Average left degree d1 =110.544
Average right degree d2 =4.722 00
Fill p =0.000 119 760
Average edge multiplicity m̃ =1.764 71
Size of LCC N =536,944
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.358 27
90-Percentile effective diameter δ0.9 =3.943 49
Median distance δM =4
Mean distance δm =3.610 58
Gini coefficient G =0.833 749
Balanced inequality ratio P =0.145 846
Left balanced inequality ratio P1 =0.039 787 6
Right balanced inequality ratio P2 =0.231 414
Relative edge distribution entropy Her =0.696 306
Power law exponent γ =2.758 03
Degree assortativity ρ =−0.170 346
Degree assortativity p-value pρ =0.000 00
Spectral norm α =3,006.83

Plots

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

Edge weight/multiplicity distribution

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