Wikibooks edits (rm)

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

Metadata

Codebrm
Internal nameedit-rmwikibooks
NameWikibooks edits (rm)
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 =70
Left size n1 =21
Right size n2 =49
Volume m =67
Unique edge count m̿ =58
Wedge count s =98
Claw count z =117
Cross count x =113
Square count q =4
4-Tour count T4 =552
Maximum degree dmax =8
Maximum left degree d1max =8
Maximum right degree d2max =3
Average degree d =1.914 29
Average left degree d1 =3.190 48
Average right degree d2 =1.367 35
Fill p =0.056 365 4
Average edge multiplicity m̃ =1.155 17
Size of LCC N =12
Diameter δ =5
50-Percentile effective diameter δ0.5 =1.696 72
90-Percentile effective diameter δ0.9 =3.580 77
Median distance δM =2
Mean distance δm =2.301 89
Gini coefficient G =0.415 474
Balanced inequality ratio P =0.335 821
Left balanced inequality ratio P1 =0.313 433
Right balanced inequality ratio P2 =0.417 910
Relative edge distribution entropy Her =0.946 903
Power law exponent γ =4.110 30
Tail power law exponent γt =2.411 00
Tail power law exponent with p γ3 =2.411 00
p-value p =0.262 000
Left tail power law exponent with p γ3,1 =3.121 00
Left p-value p1 =0.455 000
Right tail power law exponent with p γ3,2 =3.251 00
Right p-value p2 =0.033 000 0
Degree assortativity ρ =−0.034 338 2
Degree assortativity p-value pρ =0.798 032
Spectral norm α =4.079 14
Algebraic connectivity a =0.303 016
Spectral separation 1[A] / λ2[A]| =1.247 02
Controllability C =28
Relative controllability Cr =0.400 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 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

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.