Wikipedia edits (tw)

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


Internal nameedit-twwiki
NameWikipedia edits (tw)
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 =2,493
Left size n1 =632
Right size n2 =1,861
Volume m =9,208
Unique edge count m̿ =4,595
Wedge count s =174,335
Claw count z =6,501,725
Cross count x =247,189,527
Square count q =215,759
4-Tour count T4 =2,433,246
Maximum degree dmax =583
Maximum left degree d1max =583
Maximum right degree d2max =197
Average degree d =7.387 08
Average left degree d1 =14.569 6
Average right degree d2 =4.947 88
Fill p =0.003 906 81
Average edge multiplicity m̃ =2.003 92
Size of LCC N =1,697
Diameter δ =14
50-Percentile effective diameter δ0.5 =4.286 05
90-Percentile effective diameter δ0.9 =6.337 11
Median distance δM =5
Mean distance δm =4.861 55
Gini coefficient G =0.788 145
Balanced inequality ratio P =0.164 965
Left balanced inequality ratio P1 =0.147 698
Right balanced inequality ratio P2 =0.194 505
Relative edge distribution entropy Her =0.845 835
Power law exponent γ =2.753 48
Tail power law exponent γt =2.001 00
Tail power law exponent with p γ3 =2.001 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.751 00
Left p-value p1 =0.711 000
Right tail power law exponent with p γ3,2 =2.151 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.177 433
Degree assortativity p-value pρ =8.216 07 × 10−34
Spectral norm α =126.087
Algebraic connectivity a =0.035 955 2
Spectral separation 1[A] / λ2[A]| =1.112 38
Controllability C =1,121
Relative controllability Cr =0.495 579


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.