Wikipedia edits (ml)

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

Metadata

Codeml
Internal nameedit-mlwiki
NameWikipedia edits (ml)
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 =362,166
Left size n1 =36,162
Right size n2 =326,004
Volume m =2,349,591
Unique edge count m̿ =1,094,136
Wedge count s =7,236,441,972
Claw count z =78,360,916,793,788
Cross count x =817,525,241,406,720,128
Square count q =3,406,295,614
4-Tour count T4 =56,199,087,604
Maximum degree dmax =82,791
Maximum left degree d1max =82,791
Maximum right degree d2max =9,934
Average degree d =12.975 2
Average left degree d1 =64.974 0
Average right degree d2 =7.207 25
Fill p =9.281 02 × 10−5
Average edge multiplicity m̃ =2.147 44
Size of LCC N =359,504
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.499 35
90-Percentile effective diameter δ0.9 =4.489 67
Median distance δM =4
Mean distance δm =3.947 25
Gini coefficient G =0.851 875
Balanced inequality ratio P =0.144 453
Left balanced inequality ratio P1 =0.063 766 0
Right balanced inequality ratio P2 =0.200 906
Relative edge distribution entropy Her =0.750 453
Power law exponent γ =2.546 21
Tail power law exponent γt =2.091 00
Degree assortativity ρ =−0.242 073
Degree assortativity p-value pρ =0.000 00
Spectral norm α =3,682.34

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.