Wikiquote edits (tt)

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

Metadata

Codeqtt
Internal nameedit-ttwikiquote
NameWikiquote edits (tt)
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 =93
Left size n1 =25
Right size n2 =68
Volume m =130
Unique edge count m̿ =103
Wedge count s =438
Claw count z =1,674
Cross count x =5,627
Square count q =105
4-Tour count T4 =2,850
Maximum degree dmax =32
Maximum left degree d1max =32
Maximum right degree d2max =7
Average degree d =2.795 70
Average left degree d1 =5.200 00
Average right degree d2 =1.911 76
Fill p =0.060 588 2
Average edge multiplicity m̃ =1.262 14
Size of LCC N =46
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.689 08
90-Percentile effective diameter δ0.9 =7.248 37
Median distance δM =4
Mean distance δm =4.445 06
Gini coefficient G =0.514 253
Balanced inequality ratio P =0.303 846
Left balanced inequality ratio P1 =0.269 231
Right balanced inequality ratio P2 =0.353 846
Relative edge distribution entropy Her =0.915 915
Power law exponent γ =2.971 17
Tail power law exponent γt =2.821 00
Degree assortativity ρ =+0.072 582 9
Degree assortativity p-value pρ =0.466 242
Spectral norm α =8.603 04
Algebraic connectivity a =0.052 947 7
Controllability C =43
Relative controllability Cr =0.462 366

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.