Wikipedia edits (ckb)

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


Internal nameedit-ckbwiki
NameWikipedia edits (ckb)
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 =114,218
Left size n1 =3,691
Right size n2 =110,527
Volume m =475,887
Unique edge count m̿ =250,509
Wedge count s =3,375,371,429
Claw count z =76,000,390,403,201
Cross count x =1,420,102,834,985,002,752
Square count q =388,511,650
4-Tour count T4 =16,610,622,598
Maximum degree dmax =160,263
Maximum left degree d1max =160,263
Maximum right degree d2max =822
Average degree d =8.332 96
Average left degree d1 =128.932
Average right degree d2 =4.305 62
Fill p =0.000 614 060
Average edge multiplicity m̃ =1.899 68
Size of LCC N =112,962
Diameter δ =12
50-Percentile effective diameter δ0.5 =2.272 52
90-Percentile effective diameter δ0.9 =3.846 53
Median distance δM =3
Mean distance δm =3.022 03
Gini coefficient G =0.784 911
Balanced inequality ratio P =0.193 244
Left balanced inequality ratio P1 =0.038 872 7
Right balanced inequality ratio P2 =0.287 684
Relative edge distribution entropy Her =0.694 899
Power law exponent γ =3.230 32
Tail power law exponent γt =2.161 00
Tail power law exponent with p γ3 =2.161 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.851 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =2.181 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.392 413
Degree assortativity p-value pρ =0.000 00
Spectral norm α =959.713
Algebraic connectivity a =0.042 724 9
Spectral separation 1[A] / λ2[A]| =1.300 74
Controllability C =107,599
Relative controllability Cr =0.942 462


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.