Wikiquote edits (kr)

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


Internal nameedit-krwikiquote
NameWikiquote edits (kr)
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 =39
Left size n1 =14
Right size n2 =25
Volume m =37
Unique edge count m̿ =30
Wedge count s =47
Claw count z =68
Cross count x =73
Square count q =1
4-Tour count T4 =276
Maximum degree dmax =8
Maximum left degree d1max =8
Maximum right degree d2max =5
Average degree d =1.897 44
Average left degree d1 =2.642 86
Average right degree d2 =1.480 00
Fill p =0.085 714 3
Average edge multiplicity m̃ =1.233 33
Size of LCC N =9
Diameter δ =2
50-Percentile effective diameter δ0.5 =1.298 39
90-Percentile effective diameter δ0.9 =1.859 68
Median distance δM =2
Mean distance δm =1.609 20
Gini coefficient G =0.420 541
Balanced inequality ratio P =0.324 324
Left balanced inequality ratio P1 =0.297 297
Right balanced inequality ratio P2 =0.378 378
Relative edge distribution entropy Her =0.935 015
Power law exponent γ =4.654 83
Tail power law exponent γt =2.541 00
Tail power law exponent with p γ3 =2.541 00
p-value p =0.574 000
Left tail power law exponent with p γ3,1 =2.091 00
Left p-value p1 =0.695 000
Right tail power law exponent with p γ3,2 =3.131 00
Right p-value p2 =0.881 000
Degree assortativity ρ =−0.342 517
Degree assortativity p-value pρ =0.063 907 9
Spectral norm α =4.000 00
Algebraic connectivity a =0.304 084
Spectral separation 1[A] / λ2[A]| =1.171 57
Controllability C =12
Relative controllability Cr =0.315 789


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

Inter-event distribution

Node-level inter-event distribution

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.