Wikiquote edits (ta)

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

Metadata

Codeqta
Internal nameedit-tawikisource
NameWikiquote edits (ta)
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 =413,526
Left size n1 =491
Right size n2 =413,035
Volume m =492,375
Unique edge count m̿ =449,917
Wedge count s =40,514,450,337
Cross count x =2.399 3 × 1020
Square count q =77,045,767
4-Tour count T4 =162,675,069,846
Maximum degree dmax =277,985
Maximum left degree d1max =277,985
Maximum right degree d2max =295
Average degree d =2.381 35
Average left degree d1 =1,002.80
Average right degree d2 =1.192 09
Fill p =0.002 218 52
Average edge multiplicity m̃ =1.094 37
Size of LCC N =413,015
Diameter δ =16
50-Percentile effective diameter δ0.5 =3.080 80
90-Percentile effective diameter δ0.9 =3.982 16
Median distance δM =4
Mean distance δm =3.256 48
Gini coefficient G =0.577 936
Balanced inequality ratio P =0.293 524
Left balanced inequality ratio P1 =0.031 687 2
Right balanced inequality ratio P2 =0.452 848
Relative edge distribution entropy Her =0.613 030
Power law exponent γ =20.494 2
Tail power law exponent γt =4.251 00
Degree assortativity ρ =−0.293 472
Degree assortativity p-value pρ =0.000 00
Spectral norm α =788.204
Algebraic connectivity a =0.008 743 60

Plots

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

Edge weight/multiplicity distribution

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