Wikiquote edits (ang)

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

Metadata

Codeqang
Internal nameedit-angwikisource
NameWikiquote edits (ang)
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 =59
Left size n1 =20
Right size n2 =39
Volume m =68
Unique edge count m̿ =55
Wedge count s =117
Claw count z =170
Cross count x =163
Square count q =16
4-Tour count T4 =754
Maximum degree dmax =14
Maximum left degree d1max =14
Maximum right degree d2max =7
Average degree d =2.305 08
Average left degree d1 =3.400 00
Average right degree d2 =1.743 59
Fill p =0.070 512 8
Average edge multiplicity m̃ =1.236 36
Size of LCC N =17
Diameter δ =6
50-Percentile effective diameter δ0.5 =2.393 94
90-Percentile effective diameter δ0.9 =4.975 61
Median distance δM =3
Mean distance δm =3.051 72
Gini coefficient G =0.420 437
Balanced inequality ratio P =0.330 882
Left balanced inequality ratio P1 =0.294 118
Right balanced inequality ratio P2 =0.352 941
Relative edge distribution entropy Her =0.930 345
Power law exponent γ =3.603 70
Tail power law exponent γt =2.271 00
Degree assortativity ρ =−0.392 821
Degree assortativity p-value pρ =0.003 011 32
Spectral norm α =5.974 26
Algebraic connectivity a =0.085 956 9
Spectral separation 1[A] / λ2[A]| =1.729 53
Controllability C =27
Relative controllability Cr =0.457 627

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

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.