Wikibooks edits (qu)

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

Metadata

Codebqu
Internal nameedit-quwikibooks
NameWikibooks edits (qu)
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 =100
Left size n1 =25
Right size n2 =75
Volume m =134
Unique edge count m̿ =95
Wedge count s =479
Claw count z =2,947
Cross count x =15,512
Square count q =39
4-Tour count T4 =2,522
Maximum degree dmax =53
Maximum left degree d1max =53
Maximum right degree d2max =10
Average degree d =2.680 00
Average left degree d1 =5.360 00
Average right degree d2 =1.786 67
Fill p =0.050 666 7
Average edge multiplicity m̃ =1.410 53
Size of LCC N =34
Diameter δ =6
50-Percentile effective diameter δ0.5 =1.804 25
90-Percentile effective diameter δ0.9 =3.408 93
Median distance δM =2
Mean distance δm =2.469 92
Gini coefficient G =0.555 124
Balanced inequality ratio P =0.291 045
Left balanced inequality ratio P1 =0.238 806
Right balanced inequality ratio P2 =0.350 746
Relative edge distribution entropy Her =0.897 990
Power law exponent γ =3.950 78
Tail power law exponent γt =2.371 00
Tail power law exponent with p γ3 =2.371 00
p-value p =0.021 000 0
Left tail power law exponent with p γ3,1 =1.791 00
Left p-value p1 =0.063 000 0
Right tail power law exponent with p γ3,2 =7.691 00
Right p-value p2 =0.854 000
Degree assortativity ρ =−0.062 865 1
Degree assortativity p-value pρ =0.545 032
Spectral norm α =13.377 8
Algebraic connectivity a =0.252 485
Spectral separation |λ1[A] / λ2[A]| =1.959 42
Controllability C =50
Relative controllability Cr =0.500 000

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

Inter-event distribution

Node-level inter-event distribution

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.