Wikipedia edits (mus)

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

Metadata

Codemus
Internal nameedit-muswiki
NameWikipedia edits (mus)
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 =163
Left size n1 =49
Right size n2 =114
Volume m =221
Unique edge count m̿ =154
Wedge count s =1,120
Claw count z =9,523
Cross count x =67,217
Square count q =302
4-Tour count T4 =7,244
Maximum degree dmax =53
Maximum left degree d1max =53
Maximum right degree d2max =12
Average degree d =2.711 66
Average left degree d1 =4.510 20
Average right degree d2 =1.938 60
Fill p =0.027 568 9
Average edge multiplicity m̃ =1.435 06
Size of LCC N =73
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.234 26
90-Percentile effective diameter δ0.9 =7.917 92
Median distance δM =4
Mean distance δm =4.656 09
Gini coefficient G =0.525 367
Balanced inequality ratio P =0.312 217
Left balanced inequality ratio P1 =0.244 344
Right balanced inequality ratio P2 =0.352 941
Relative edge distribution entropy Her =0.894 483
Power law exponent γ =3.697 56
Tail power law exponent γt =2.301 00
Tail power law exponent with p γ3 =2.301 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =2.011 00
Left p-value p1 =0.301 000
Right tail power law exponent with p γ3,2 =5.731 00
Right p-value p2 =0.094 000 0
Degree assortativity ρ =+0.020 807 5
Degree assortativity p-value pρ =0.797 845
Spectral norm α =11.582 0
Algebraic connectivity a =0.014 151 5
Spectral separation |λ1[A] / λ2[A]| =1.466 03
Controllability C =59
Relative controllability Cr =0.380 645

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.