Wikiquote edits (ga)

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

Metadata

Codeqga
Internal nameedit-gawikiquote
NameWikiquote edits (ga)
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 =112
Left size n1 =29
Right size n2 =83
Volume m =157
Unique edge count m̿ =123
Wedge count s =860
Claw count z =5,576
Cross count x =30,726
Square count q =258
4-Tour count T4 =5,766
Maximum degree dmax =49
Maximum left degree d1max =49
Maximum right degree d2max =9
Average degree d =2.803 57
Average left degree d1 =5.413 79
Average right degree d2 =1.891 57
Fill p =0.051 101 0
Average edge multiplicity m̃ =1.276 42
Size of LCC N =73
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.760 89
90-Percentile effective diameter δ0.9 =6.242 51
Median distance δM =4
Mean distance δm =4.307 77
Gini coefficient G =0.509 631
Balanced inequality ratio P =0.318 471
Left balanced inequality ratio P1 =0.235 669
Right balanced inequality ratio P2 =0.356 688
Relative edge distribution entropy Her =0.885 769
Power law exponent γ =3.199 44
Tail power law exponent γt =2.151 00
Tail power law exponent with p γ3 =2.151 00
p-value p =0.350 000
Left tail power law exponent with p γ3,1 =1.791 00
Left p-value p1 =0.384 000
Right tail power law exponent with p γ3,2 =4.651 00
Right p-value p2 =0.251 000
Degree assortativity ρ =−0.022 348 5
Degree assortativity p-value pρ =0.806 180
Spectral norm α =10.747 6
Algebraic connectivity a =0.048 329 2
Spectral separation |λ1[A] / λ2[A]| =1.923 99
Controllability C =55
Relative controllability Cr =0.504 587

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.