Wikipedia edits (pms)

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

Metadata

Codepms
Internal nameedit-pmswiki
NameWikipedia edits (pms)
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 =100,224
Left size n1 =2,206
Right size n2 =98,018
Volume m =820,463
Unique edge count m̿ =516,674
Wedge count s =6,161,512,530
Claw count z =77,095,266,439,718
Cross count x =835,663,257,985,774,976
Square count q =8,747,089,216
4-Tour count T4 =94,623,827,888
Maximum degree dmax =113,361
Maximum left degree d1max =113,361
Maximum right degree d2max =596
Average degree d =16.372 6
Average left degree d1 =371.923
Average right degree d2 =8.370 53
Fill p =0.002 389 49
Average edge multiplicity m̃ =1.587 97
Size of LCC N =99,346
Diameter δ =11
50-Percentile effective diameter δ0.5 =1.975 04
90-Percentile effective diameter δ0.9 =3.851 00
Median distance δM =2
Mean distance δm =3.008 41
Gini coefficient G =0.782 449
Balanced inequality ratio P =0.203 428
Left balanced inequality ratio P1 =0.030 248 8
Right balanced inequality ratio P2 =0.288 654
Relative edge distribution entropy Her =0.703 030
Power law exponent γ =1.818 28
Tail power law exponent γt =3.751 00
Degree assortativity ρ =−0.289 440
Degree assortativity p-value pρ =0.000 00
Spectral norm α =979.989
Algebraic connectivity a =0.108 046

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.