Wikipedia edits (cho)

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


Internal nameedit-chowiki
NameWikipedia edits (cho)
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 =278
Left size n1 =77
Right size n2 =201
Volume m =540
Unique edge count m̿ =355
Wedge count s =4,363
Claw count z =64,246
Cross count x =872,637
Square count q =1,564
4-Tour count T4 =30,738
Maximum degree dmax =98
Maximum left degree d1max =98
Maximum right degree d2max =29
Average degree d =3.884 89
Average left degree d1 =7.012 99
Average right degree d2 =2.686 57
Fill p =0.022 937 3
Average edge multiplicity m̃ =1.521 13
Size of LCC N =192
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.882 89
90-Percentile effective diameter δ0.9 =6.283 78
Median distance δM =4
Mean distance δm =4.447 26
Gini coefficient G =0.556 125
Balanced inequality ratio P =0.289 815
Left balanced inequality ratio P1 =0.231 481
Right balanced inequality ratio P2 =0.350 000
Relative edge distribution entropy Her =0.883 596
Power law exponent γ =2.814 83
Tail power law exponent γt =2.171 00
Tail power law exponent with p γ3 =2.171 00
p-value p =0.253 000
Left tail power law exponent with p γ3,1 =2.031 00
Left p-value p1 =0.603 000
Right tail power law exponent with p γ3,2 =3.421 00
Right p-value p2 =0.001 000 00
Degree assortativity ρ =−0.254 242
Degree assortativity p-value pρ =1.213 83 × 10−6
Spectral norm α =17.082 2
Algebraic connectivity a =0.049 101 2
Spectral separation 1[A] / λ2[A]| =1.091 32
Controllability C =119
Relative controllability Cr =0.445 693


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.