Wikiquote edits (fi)

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

Metadata

Codeqfi
Internal nameedit-fiwikisource
NameWikiquote edits (fi)
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 =15,676
Left size n1 =580
Right size n2 =15,096
Volume m =93,388
Unique edge count m̿ =22,263
Wedge count s =56,237,599
Claw count z =177,002,264,516
Cross count x =444,813,945,070,540
Square count q =1,334,021
4-Tour count T4 =235,709,978
Maximum degree dmax =56,511
Maximum left degree d1max =56,511
Maximum right degree d2max =1,971
Average degree d =11.914 8
Average left degree d1 =161.014
Average right degree d2 =6.186 27
Fill p =0.002 542 69
Average edge multiplicity m̃ =4.194 76
Size of LCC N =15,297
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.026 23
90-Percentile effective diameter δ0.9 =3.885 74
Median distance δM =4
Mean distance δm =3.130 55
Gini coefficient G =0.885 041
Balanced inequality ratio P =0.114 774
Left balanced inequality ratio P1 =0.037 863 5
Right balanced inequality ratio P2 =0.182 689
Relative edge distribution entropy Her =0.701 054
Power law exponent γ =4.610 41
Tail power law exponent γt =2.531 00
Degree assortativity ρ =−0.188 414
Degree assortativity p-value pρ =5.369 75 × 10−177
Spectral norm α =5,051.90
Algebraic connectivity a =0.044 639 5
Spectral separation 1[A] / λ2[A]| =8.355 87
Controllability C =14,518
Relative controllability Cr =0.931 716

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.