Wikiversity edits (en)

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

Metadata

Codeyen
Internal nameedit-enwikiversity
NameWikiversity edits (en)
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 =199,910
Left size n1 =30,548
Right size n2 =169,362
Volume m =1,407,455
Unique edge count m̿ =387,844
Wedge count s =1,419,302,989
Claw count z =9,356,624,805,625
Cross count x =53,046,632,408,245,848
Square count q =305,290,633
4-Tour count T4 =8,120,414,108
Maximum degree dmax =49,880
Maximum left degree d1max =49,880
Maximum right degree d2max =14,788
Average degree d =14.080 9
Average left degree d1 =46.073 6
Average right degree d2 =8.310 34
Fill p =7.496 50 × 10−5
Average edge multiplicity m̃ =3.628 92
Size of LCC N =189,516
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.595 33
90-Percentile effective diameter δ0.9 =4.999 64
Median distance δM =4
Mean distance δm =4.164 36
Gini coefficient G =0.826 609
Balanced inequality ratio P =0.159 756
Left balanced inequality ratio P1 =0.104 933
Right balanced inequality ratio P2 =0.213 094
Relative edge distribution entropy Her =0.789 955
Power law exponent γ =2.740 10
Degree assortativity ρ =−0.112 760
Degree assortativity p-value pρ =0.000 00
Spectral norm α =4,503.11

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.