Wiktionary edits (ch)

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

Metadata

Codemch
Internal nameedit-chwiktionary
NameWiktionary edits (ch)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
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

Statistics

Size n =103
Left size n1 =36
Right size n2 =67
Volume m =98
Unique edge count m̿ =83
Wedge count s =144
Claw count z =208
Cross count x =231
Square count q =8
4-Tour count T4 =834
Maximum degree dmax =12
Maximum left degree d1max =10
Maximum right degree d2max =12
Average degree d =1.902 91
Average left degree d1 =2.722 22
Average right degree d2 =1.462 69
Fill p =0.034 411 3
Average edge multiplicity m̃ =1.180 72
Size of LCC N =29
Diameter δ =6
50-Percentile effective diameter δ0.5 =2.869 00
90-Percentile effective diameter δ0.9 =4.459 49
Median distance δM =3
Mean distance δm =3.276 11
Gini coefficient G =0.415 321
Balanced inequality ratio P =0.341 837
Left balanced inequality ratio P1 =0.326 531
Right balanced inequality ratio P2 =0.397 959
Relative edge distribution entropy Her =0.948 330
Power law exponent γ =4.422 59
Tail power law exponent γt =2.491 00
Degree assortativity ρ =−0.014 931 9
Degree assortativity p-value pρ =0.893 418
Spectral norm α =5.388 46
Algebraic connectivity a =0.155 164
Spectral separation 1[A] / λ2[A]| =1.153 64
Controllability C =31
Relative controllability Cr =0.300 971

Plots

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

Matrix decompositions plots

Downloads

References

[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.