Wikipedia edits (an)

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

Metadata

Codean
Internal nameedit-anwiki
NameWikipedia edits (an)
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 =107,915
Left size n1 =4,474
Right size n2 =103,441
Volume m =1,511,668
Unique edge count m̿ =653,486
Wedge count s =5,772,500,383
Claw count z =57,371,302,276,885
Cross count x =544,556,203,239,812,672
Square count q =11,826,037,743
4-Tour count T4 =117,700,123,808
Maximum degree dmax =201,151
Maximum left degree d1max =201,151
Maximum right degree d2max =6,956
Average degree d =28.015 9
Average left degree d1 =337.878
Average right degree d2 =14.613 8
Fill p =0.001 412 04
Average edge multiplicity m̃ =2.313 24
Size of LCC N =106,341
Diameter δ =13
50-Percentile effective diameter δ0.5 =2.893 30
90-Percentile effective diameter δ0.9 =3.833 83
Median distance δM =3
Mean distance δm =3.065 96
Gini coefficient G =0.852 431
Balanced inequality ratio P =0.163 872
Left balanced inequality ratio P1 =0.020 393 4
Right balanced inequality ratio P2 =0.219 548
Relative edge distribution entropy Her =0.712 946
Power law exponent γ =1.913 68
Tail power law exponent γt =3.161 00
Degree assortativity ρ =−0.326 770
Degree assortativity p-value pρ =0.000 00
Spectral norm α =7,112.26
Algebraic connectivity a =0.064 262 3

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.