Wikipedia edits (tr)

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

Metadata

Codetr
Internal nameedit-trwiki
NameWikipedia edits (tr)
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 =1,687,395
Left size n1 =180,855
Right size n2 =1,506,540
Volume m =13,472,951
Unique edge count m̿ =6,875,278
Wedge count s =235,969,896,061
Claw count z =13,416,432,018,815,184
Cross count x =7.069 33 × 1020
Maximum degree dmax =533,944
Maximum left degree d1max =533,944
Maximum right degree d2max =50,884
Average degree d =15.968 9
Average left degree d1 =74.495 9
Average right degree d2 =8.942 98
Fill p =2.523 36 × 10−5
Average edge multiplicity m̃ =1.959 62
Size of LCC N =1,642,519
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.467 18
90-Percentile effective diameter δ0.9 =4.378 23
Median distance δM =4
Mean distance δm =3.893 89
Gini coefficient G =0.871 345
Balanced inequality ratio P =0.135 032
Left balanced inequality ratio P1 =0.045 271 2
Right balanced inequality ratio P2 =0.182 996
Power law exponent γ =2.326 64
Degree assortativity ρ =−0.055 955 4
Degree assortativity p-value pρ =0.000 00
Spectral norm α =7,559.08
Spectral separation 1[A] / λ2[A]| =1.175 95
Controllability C =1,453,687
Relative controllability Cr =0.871 331

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

Zipf plot

Hop distribution

Delaunay graph drawing

Edge weight/multiplicity distribution

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