Wikibooks edits (ks)

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

Metadata

Codebks
Internal nameedit-kswikibooks
NameWikibooks edits (ks)
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 =89
Left size n1 =25
Right size n2 =64
Volume m =110
Unique edge count m̿ =83
Wedge count s =277
Claw count z =766
Cross count x =1,829
Square count q =57
4-Tour count T4 =1,734
Maximum degree dmax =25
Maximum left degree d1max =25
Maximum right degree d2max =7
Average degree d =2.471 91
Average left degree d1 =4.400 00
Average right degree d2 =1.718 75
Fill p =0.051 875 0
Average edge multiplicity m̃ =1.325 30
Size of LCC N =43
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.775 06
90-Percentile effective diameter δ0.9 =6.543 24
Median distance δM =4
Mean distance δm =4.341 14
Gini coefficient G =0.473 153
Balanced inequality ratio P =0.322 727
Left balanced inequality ratio P1 =0.272 727
Right balanced inequality ratio P2 =0.345 455
Relative edge distribution entropy Her =0.921 784
Power law exponent γ =3.511 98
Tail power law exponent γt =2.891 00
Degree assortativity ρ =+0.241 924
Degree assortativity p-value pρ =0.027 563 3
Spectral norm α =7.604 09
Algebraic connectivity a =0.062 736 9
Spectral separation 1[A] / λ2[A]| =1.008 70
Controllability C =38
Relative controllability Cr =0.441 860

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.