Wikiversity edits (fr)

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

Metadata

Codeyfr
Internal nameedit-frwikiversity
NameWikiversity edits (fr)
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 =50,559
Left size n1 =7,561
Right size n2 =42,998
Volume m =541,214
Unique edge count m̿ =160,080
Wedge count s =622,995,107
Claw count z =3,209,963,965,017
Cross count x =14,024,321,382,939,912
Square count q =284,763,499
4-Tour count T4 =4,770,603,592
Maximum degree dmax =112,605
Maximum left degree d1max =112,605
Maximum right degree d2max =2,088
Average degree d =21.409 2
Average left degree d1 =71.579 7
Average right degree d2 =12.587 0
Fill p =0.000 492 390
Average edge multiplicity m̃ =3.380 90
Size of LCC N =50,037
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.913 69
90-Percentile effective diameter δ0.9 =3.922 91
Median distance δM =3
Mean distance δm =3.228 33
Gini coefficient G =0.810 972
Balanced inequality ratio P =0.176 746
Left balanced inequality ratio P1 =0.079 569 3
Right balanced inequality ratio P2 =0.242 331
Relative edge distribution entropy Her =0.756 837
Power law exponent γ =2.041 10
Tail power law exponent γt =2.851 00
Degree assortativity ρ =−0.213 848
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,180.34
Algebraic connectivity a =0.119 444

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

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.