Wikipedia edits (din)

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


Internal nameedit-dinwiki
NameWikipedia edits (din)
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 =197
Left size n1 =26
Right size n2 =171
Volume m =690
Unique edge count m̿ =559
Wedge count s =21,314
Claw count z =658,958
Cross count x =17,930,275
Square count q =13,367
4-Tour count T4 =194,074
Maximum degree dmax =145
Maximum left degree d1max =145
Maximum right degree d2max =25
Average degree d =7.005 08
Average left degree d1 =26.538 5
Average right degree d2 =4.035 09
Fill p =0.125 731
Average edge multiplicity m̃ =1.234 35
Size of LCC N =186
Diameter δ =7
50-Percentile effective diameter δ0.5 =1.694 55
90-Percentile effective diameter δ0.9 =3.345 10
Median distance δM =2
Mean distance δm =2.413 71
Gini coefficient G =0.605 339
Balanced inequality ratio P =0.278 986
Left balanced inequality ratio P1 =0.198 551
Right balanced inequality ratio P2 =0.389 855
Relative edge distribution entropy Her =0.823 608
Power law exponent γ =1.878 28
Tail power law exponent γt =2.801 00
Tail power law exponent with p γ3 =2.801 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.471 00
Left p-value p1 =0.015 000 0
Right tail power law exponent with p γ3,2 =8.401 00
Right p-value p2 =0.055 000 0
Degree assortativity ρ =−0.074 721 0
Degree assortativity p-value pρ =0.077 537 7
Spectral norm α =24.609 0
Algebraic connectivity a =0.471 574
Spectral separation 1[A] / λ2[A]| =1.745 53
Controllability C =146
Relative controllability Cr =0.744 898


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.