Wiktionary edits (sc)

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

Metadata

Codemsc
Internal nameedit-scwiktionary
NameWiktionary edits (sc)
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 =123
Left size n1 =29
Right size n2 =94
Volume m =240
Unique edge count m̿ =134
Wedge count s =817
Claw count z =4,414
Cross count x =18,799
Square count q =134
4-Tour count T4 =4,764
Maximum degree dmax =59
Maximum left degree d1max =59
Maximum right degree d2max =18
Average degree d =3.902 44
Average left degree d1 =8.275 86
Average right degree d2 =2.553 19
Fill p =0.049 156 3
Average edge multiplicity m̃ =1.791 04
Size of LCC N =84
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.801 18
90-Percentile effective diameter δ0.9 =6.900 00
Median distance δM =4
Mean distance δm =4.543 22
Gini coefficient G =0.628 059
Balanced inequality ratio P =0.254 167
Left balanced inequality ratio P1 =0.187 500
Right balanced inequality ratio P2 =0.316 667
Relative edge distribution entropy Her =0.888 623
Power law exponent γ =3.300 51
Tail power law exponent γt =2.181 00
Tail power law exponent with p γ3 =2.181 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.751 00
Left p-value p1 =0.474 000
Right tail power law exponent with p γ3,2 =5.071 00
Right p-value p2 =0.095 000 0
Degree assortativity ρ =−0.085 209 6
Degree assortativity p-value pρ =0.327 623
Spectral norm α =23.708 0
Algebraic connectivity a =0.067 112 9
Spectral separation |λ1[A] / λ2[A]| =1.596 77
Controllability C =66
Relative controllability Cr =0.550 000

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

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.