Wikiquote edits (fo)

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

Metadata

Codeqfo
Internal nameedit-fowikisource
NameWikiquote edits (fo)
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 =691
Left size n1 =155
Right size n2 =536
Volume m =991
Unique edge count m̿ =651
Wedge count s =21,299
Claw count z =1,097,470
Cross count x =46,458,768
Square count q =81
4-Tour count T4 =87,546
Maximum degree dmax =198
Maximum left degree d1max =198
Maximum right degree d2max =120
Average degree d =2.868 31
Average left degree d1 =6.393 55
Average right degree d2 =1.848 88
Fill p =0.007 835 82
Average edge multiplicity m̃ =1.522 27
Size of LCC N =473
Diameter δ =12
50-Percentile effective diameter δ0.5 =4.266 56
90-Percentile effective diameter δ0.9 =7.262 07
Median distance δM =5
Mean distance δm =4.837 09
Gini coefficient G =0.637 080
Relative edge distribution entropy Her =0.856 018
Power law exponent γ =5.170 97
Tail power law exponent γt =2.661 00
Tail power law exponent with p γ3 =2.661 00
p-value p =0.185 000
Left tail power law exponent with p γ3,1 =1.961 00
Left p-value p1 =0.193 000
Right tail power law exponent with p γ3,2 =3.221 00
Right p-value p2 =0.025 000 0
Degree assortativity ρ =−0.201 047
Degree assortativity p-value pρ =2.307 35 × 10−7
Spectral norm α =78.988 8
Algebraic connectivity a =0.022 641 5

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.