Wiktionary edits (mo)

This is the bipartite edit network of the молдовеняскэ Wiktionary. It contains users and pages from the молдовеняскэ Wiktionary, connected by edit events. Each edge represents an edit. The dataset includes the timestamp of each edit.

Metadata

Codemmo
Internal nameedit-mowiktionary
NameWiktionary edits (mo)
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 =271
Left size n1 =41
Right size n2 =230
Volume m =359
Unique edge count m̿ =285
Wedge count s =6,163
Claw count z =142,261
Cross count x =2,579,999
Square count q =132
4-Tour count T4 =26,586
Maximum degree dmax =78
Maximum left degree d1max =78
Maximum right degree d2max =30
Average degree d =2.649 45
Average left degree d1 =8.756 10
Average right degree d2 =1.560 87
Fill p =0.030 222 7
Average edge multiplicity m̃ =1.259 65
Size of LCC N =78
Diameter δ =2
50-Percentile effective diameter δ0.5 =1.481 26
90-Percentile effective diameter δ0.9 =1.896 25
Median distance δM =2
Mean distance δm =1.952 09
Gini coefficient G =0.605 296
Relative edge distribution entropy Her =0.825 795
Power law exponent γ =4.995 33
Tail power law exponent γt =2.621 00
Degree assortativity ρ =−0.457 072
Degree assortativity p-value pρ =4.061 55 × 10−16
Controllability C =198
Relative controllability Cr =0.733 333

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

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.