Wikipedia edits (ho)

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

Metadata

Codeho
Internal nameedit-howiki
NameWikipedia edits (ho)
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 =181
Left size n1 =53
Right size n2 =128
Volume m =345
Unique edge count m̿ =204
Wedge count s =2,634
Claw count z =38,025
Cross count x =442,433
Square count q =909
4-Tour count T4 =18,276
Maximum degree dmax =88
Maximum left degree d1max =88
Maximum right degree d2max =26
Average degree d =3.812 15
Average left degree d1 =6.509 43
Average right degree d2 =2.695 31
Fill p =0.030 070 8
Average edge multiplicity m̃ =1.691 18
Size of LCC N =107
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.848 67
90-Percentile effective diameter δ0.9 =5.967 85
Median distance δM =3
Mean distance δm =3.755 01
Gini coefficient G =0.576 019
Balanced inequality ratio P =0.286 957
Left balanced inequality ratio P1 =0.202 899
Right balanced inequality ratio P2 =0.356 522
Relative edge distribution entropy Her =0.867 176
Power law exponent γ =3.304 94
Tail power law exponent γt =3.191 00
Tail power law exponent with p γ3 =3.191 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.951 00
Left p-value p1 =0.256 000
Right tail power law exponent with p γ3,2 =4.801 00
Right p-value p2 =0.040 000 0
Degree assortativity ρ =−0.156 927
Degree assortativity p-value pρ =0.024 993 8
Spectral norm α =22.917 5
Algebraic connectivity a =0.035 199 7
Spectral separation 1[A] / λ2[A]| =1.235 37
Controllability C =82
Relative controllability Cr =0.455 556

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.