Wikipedia edits (ku)

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


Internal nameedit-kuwiki
NameWikipedia edits (ku)
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 =61,976
Left size n1 =3,534
Right size n2 =58,442
Volume m =597,402
Unique edge count m̿ =285,072
Wedge count s =874,914,665
Claw count z =3,303,278,843,739
Cross count x =11,338,953,017,895,616
Square count q =1,334,693,452
4-Tour count T4 =14,177,912,028
Maximum degree dmax =43,251
Maximum left degree d1max =43,251
Maximum right degree d2max =4,892
Average degree d =19.278 5
Average left degree d1 =169.044
Average right degree d2 =10.222 1
Fill p =0.001 380 27
Average edge multiplicity m̃ =2.095 62
Size of LCC N =60,167
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.268 11
90-Percentile effective diameter δ0.9 =3.904 59
Median distance δM =4
Mean distance δm =3.458 72
Gini coefficient G =0.854 058
Balanced inequality ratio P =0.145 048
Left balanced inequality ratio P1 =0.043 846 5
Right balanced inequality ratio P2 =0.208 694
Relative edge distribution entropy Her =0.736 173
Power law exponent γ =2.058 67
Tail power law exponent γt =1.991 00
Degree assortativity ρ =−0.347 825
Degree assortativity p-value pρ =0.000 00
Spectral norm α =4,891.73
Algebraic connectivity a =0.062 229 5


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

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.