Wikiversity edits (cs)

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

Metadata

Codeycs
Internal nameedit-cswikiversity
NameWikiversity edits (cs)
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 =11,266
Left size n1 =852
Right size n2 =10,414
Volume m =71,820
Unique edge count m̿ =22,522
Wedge count s =17,494,220
Claw count z =14,307,904,427
Cross count x =10,220,484,087,537
Square count q =3,911,025
4-Tour count T4 =101,318,604
Maximum degree dmax =12,351
Maximum left degree d1max =12,351
Maximum right degree d2max =1,653
Average degree d =12.749 9
Average left degree d1 =84.295 8
Average right degree d2 =6.896 49
Fill p =0.002 538 34
Average edge multiplicity m̃ =3.188 88
Size of LCC N =11,011
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.415 48
90-Percentile effective diameter δ0.9 =4.936 00
Median distance δM =4
Mean distance δm =3.793 80
Gini coefficient G =0.812 753
Balanced inequality ratio P =0.173 963
Left balanced inequality ratio P1 =0.093 636 9
Right balanced inequality ratio P2 =0.248 009
Relative edge distribution entropy Her =0.746 464
Power law exponent γ =2.773 80
Tail power law exponent γt =2.841 00
Tail power law exponent with p γ3 =2.841 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.801 00
Left p-value p1 =0.121 000
Right tail power law exponent with p γ3,2 =3.891 00
Right p-value p2 =0.028 000 0
Degree assortativity ρ =−0.226 426
Degree assortativity p-value pρ =1.004 35 × 10−259
Spectral norm α =1,013.59
Spectral separation 1[A] / λ2[A]| =1.732 56
Controllability C =9,815
Relative controllability Cr =0.872 212

Plots

Fruchterman–Reingold graph drawing

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

Double Laplacian graph drawing

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.