Wikiquote edits (cs)

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


Internal nameedit-cswikisource
NameWikiquote edits (cs)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
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


Size n =53,415
Left size n1 =751
Right size n2 =52,664
Volume m =135,389
Unique edge count m̿ =82,819
Wedge count s =274,801,292
Claw count z =1,027,159,759,472
Cross count x =3,563,005,683,753,184
Square count q =16,316,178
4-Tour count T4 =1,229,944,406
Maximum degree dmax =24,824
Maximum left degree d1max =24,824
Maximum right degree d2max =2,017
Average degree d =5.069 33
Average left degree d1 =180.278
Average right degree d2 =2.570 81
Fill p =0.002 094 00
Average edge multiplicity m̃ =1.634 76
Size of LCC N =53,109
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.410 59
90-Percentile effective diameter δ0.9 =3.904 30
Median distance δM =4
Mean distance δm =3.713 72
Gini coefficient G =0.731 152
Balanced inequality ratio P =0.218 500
Left balanced inequality ratio P1 =0.051 193 2
Right balanced inequality ratio P2 =0.326 371
Relative edge distribution entropy Her =0.701 425
Power law exponent γ =4.084 23
Tail power law exponent γt =3.341 00
Tail power law exponent with p γ3 =3.341 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.521 00
Left p-value p1 =0.839 000
Right tail power law exponent with p γ3,2 =3.531 00
Right p-value p2 =0.016 000 0
Degree assortativity ρ =−0.129 502
Degree assortativity p-value pρ =1.498 56 × 10−306
Spectral norm α =698.160
Algebraic connectivity a =0.026 871 7
Spectral separation 1[A] / λ2[A]| =1.864 80
Controllability C =51,980
Relative controllability Cr =0.974 485


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



[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., January 2010.