Wiktionary edits (cr)

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


Internal nameedit-crwiktionary
NameWiktionary edits (cr)
Data sourcehttp://dumps.wikimedia.org/
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 =106
Left size n1 =33
Right size n2 =73
Volume m =124
Unique edge count m̿ =100
Wedge count s =454
Claw count z =2,231
Cross count x =9,131
Square count q =109
4-Tour count T4 =2,908
Maximum degree dmax =33
Maximum left degree d1max =33
Maximum right degree d2max =4
Average degree d =2.339 62
Average left degree d1 =3.757 58
Average right degree d2 =1.698 63
Fill p =0.041 511 0
Average edge multiplicity m̃ =1.240 00
Size of LCC N =30
Diameter δ =5
50-Percentile effective diameter δ0.5 =1.610 17
90-Percentile effective diameter δ0.9 =3.008 33
Median distance δM =2
Mean distance δm =2.217 68
Gini coefficient G =0.447 194
Balanced inequality ratio P =0.346 774
Left balanced inequality ratio P1 =0.258 065
Right balanced inequality ratio P2 =0.379 032
Relative edge distribution entropy Her =0.911 269
Power law exponent γ =3.727 31
Tail power law exponent with p γ3 =3.281 00
p-value p =0.003 000 00
Left tail power law exponent with p γ3,1 =2.321 00
Left p-value p1 =0.454 000
Right tail power law exponent with p γ3,2 =6.801 00
Right p-value p2 =0.645 000
Degree assortativity ρ =+0.487 739
Degree assortativity p-value pρ =2.648 30 × 10−7
Spectral norm α =8.873 60
Algebraic connectivity a =0.384 039
Spectral separation 1[A] / λ2[A]| =2.461 09
Controllability C =44
Relative controllability Cr =0.415 094


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. http://dumps.wikimedia.org/, January 2010.