Wikibooks edits (sk)

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

Metadata

Codebsk
Internal nameedit-skwikibooks
NameWikibooks edits (sk)
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 =2,586
Left size n1 =403
Right size n2 =2,183
Volume m =9,256
Unique edge count m̿ =4,227
Wedge count s =590,326
Claw count z =93,331,565
Cross count x =13,111,273,363
Square count q =95,226
4-Tour count T4 =3,135,370
Maximum degree dmax =1,868
Maximum left degree d1max =1,868
Maximum right degree d2max =186
Average degree d =7.158 55
Average left degree d1 =22.967 7
Average right degree d2 =4.240 04
Fill p =0.004 804 78
Average edge multiplicity m̃ =2.189 73
Size of LCC N =2,353
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.463 38
90-Percentile effective diameter δ0.9 =5.057 05
Median distance δM =4
Mean distance δm =3.910 84
Gini coefficient G =0.762 235
Relative edge distribution entropy Her =0.796 118
Power law exponent γ =2.922 14
Tail power law exponent γt =2.771 00
Tail power law exponent with p γ3 =2.771 00
p-value p =0.003 000 00
Left tail power law exponent with p γ3,1 =1.821 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =3.151 00
Right p-value p2 =0.008 000 00
Degree assortativity ρ =−0.300 456
Degree assortativity p-value pρ =6.438 84 × 10−89
Spectral norm α =191.903
Algebraic connectivity a =0.028 233 2

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.