Wikiquote edits (vo)

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

Metadata

Codeqvo
Internal nameedit-vowikiquote
NameWikiquote edits (vo)
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 =100
Left size n1 =30
Right size n2 =70
Volume m =139
Unique edge count m̿ =106
Wedge count s =550
Claw count z =2,808
Cross count x =12,283
Square count q =143
4-Tour count T4 =3,568
Maximum degree dmax =37
Maximum left degree d1max =37
Maximum right degree d2max =8
Average degree d =2.780 00
Average left degree d1 =4.633 33
Average right degree d2 =1.985 71
Fill p =0.050 476 2
Average edge multiplicity m̃ =1.311 32
Size of LCC N =40
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.190 83
90-Percentile effective diameter δ0.9 =5.656 28
Median distance δM =3
Mean distance δm =3.282 62
Gini coefficient G =0.486 536
Balanced inequality ratio P =0.327 338
Left balanced inequality ratio P1 =0.266 187
Right balanced inequality ratio P2 =0.366 906
Relative edge distribution entropy Her =0.906 524
Power law exponent γ =3.182 64
Tail power law exponent γt =3.121 00
Degree assortativity ρ =+0.244 695
Degree assortativity p-value pρ =0.011 472 3
Spectral norm α =9.416 97
Algebraic connectivity a =0.064 593 2
Controllability C =42
Relative controllability Cr =0.420 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 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.