Wikipedia edits (oc)

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

Metadata

Codeoc
Internal nameedit-ocwiki
NameWikipedia edits (oc)
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 =143,371
Left size n1 =4,172
Right size n2 =139,199
Volume m =1,927,431
Unique edge count m̿ =966,674
Wedge count s =14,254,559,161
Claw count z =246,569,644,058,353
Cross count x =3,863,724,107,373,547,008
Square count q =26,574,503,321
4-Tour count T4 =269,616,769,964
Maximum degree dmax =197,361
Maximum left degree d1max =197,361
Maximum right degree d2max =2,665
Average degree d =26.887 3
Average left degree d1 =461.992
Average right degree d2 =13.846 6
Fill p =0.001 664 56
Average edge multiplicity m̃ =1.993 88
Size of LCC N =142,011
Diameter δ =11
50-Percentile effective diameter δ0.5 =2.418 35
90-Percentile effective diameter δ0.9 =3.833 20
Median distance δM =3
Mean distance δm =3.020 33
Gini coefficient G =0.801 559
Balanced inequality ratio P =0.190 137
Left balanced inequality ratio P1 =0.028 311 8
Right balanced inequality ratio P2 =0.278 551
Relative edge distribution entropy Her =0.714 318
Power law exponent γ =1.712 77
Tail power law exponent γt =3.601 00
Degree assortativity ρ =−0.268 616
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,938.51

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.