Wikiquote edits (ks)

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


Internal nameedit-kswikiquote
NameWikiquote edits (ks)
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 =77
Left size n1 =26
Right size n2 =51
Volume m =70
Unique edge count m̿ =61
Wedge count s =91
Claw count z =116
Cross count x =113
Square count q =4
4-Tour count T4 =550
Maximum degree dmax =10
Maximum left degree d1max =10
Maximum right degree d2max =4
Average degree d =1.818 18
Average left degree d1 =2.692 31
Average right degree d2 =1.372 55
Fill p =0.046 003 0
Average edge multiplicity m̃ =1.147 54
Size of LCC N =9
Diameter δ =4
50-Percentile effective diameter δ0.5 =1.357 14
90-Percentile effective diameter δ0.9 =2.768 75
Median distance δM =2
Mean distance δm =1.839 08
Gini coefficient G =0.420 448
Balanced inequality ratio P =0.335 714
Left balanced inequality ratio P1 =0.342 857
Right balanced inequality ratio P2 =0.414 286
Relative edge distribution entropy Her =0.949 612
Power law exponent γ =4.484 10
Tail power law exponent γt =2.501 00
Tail power law exponent with p γ3 =2.501 00
p-value p =0.410 000
Left tail power law exponent with p γ3,1 =2.651 00
Left p-value p1 =0.605 000
Right tail power law exponent with p γ3,2 =3.341 00
Right p-value p2 =0.842 000
Degree assortativity ρ =−0.211 389
Degree assortativity p-value pρ =0.101 969
Spectral norm α =4.250 46
Spectral separation 1[A] / λ2[A]| =1.022 65
Controllability C =27
Relative controllability Cr =0.350 649


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 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.