Wikipedia edits (mh)

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

Metadata

Codemh
Internal nameedit-mhwiki
NameWikipedia edits (mh)
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 =307
Left size n1 =102
Right size n2 =205
Volume m =662
Unique edge count m̿ =365
Wedge count s =3,691
Claw count z =48,016
Cross count x =579,052
Square count q =1,208
4-Tour count T4 =25,306
Maximum degree dmax =90
Maximum left degree d1max =90
Maximum right degree d2max =46
Average degree d =4.312 70
Average left degree d1 =6.490 20
Average right degree d2 =3.229 27
Fill p =0.017 455 8
Average edge multiplicity m̃ =1.813 70
Size of LCC N =191
Diameter δ =12
50-Percentile effective diameter δ0.5 =4.335 27
90-Percentile effective diameter δ0.9 =6.846 83
Median distance δM =5
Mean distance δm =4.787 91
Gini coefficient G =0.593 456
Relative edge distribution entropy Her =0.894 807
Power law exponent γ =3.046 29
Tail power law exponent γt =2.601 00
Tail power law exponent with p γ3 =2.601 00
p-value p =0.001 000 00
Left tail power law exponent with p γ3,1 =1.881 00
Left p-value p1 =0.130 000
Right tail power law exponent with p γ3,2 =3.391 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.237 965
Degree assortativity p-value pρ =4.287 60 × 10−6
Spectral norm α =29.689 9
Algebraic connectivity a =0.031 596 9

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.