Wikiquote edits (sr)

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

Metadata

Codeqsr
Internal nameedit-srwikisource
NameWikiquote edits (sr)
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 =17,185
Left size n1 =489
Right size n2 =16,696
Volume m =46,213
Unique edge count m̿ =24,195
Wedge count s =35,714,375
Claw count z =72,163,264,513
Cross count x =126,013,848,728,356
Square count q =769,654
4-Tour count T4 =149,082,022
Maximum degree dmax =12,346
Maximum left degree d1max =12,346
Maximum right degree d2max =418
Average degree d =5.378 30
Average left degree d1 =94.505 1
Average right degree d2 =2.767 91
Fill p =0.002 963 50
Average edge multiplicity m̃ =1.910 02
Size of LCC N =16,790
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.379 51
90-Percentile effective diameter δ0.9 =3.955 45
Median distance δM =4
Mean distance δm =3.656 59
Gini coefficient G =0.752 294
Balanced inequality ratio P =0.201 653
Left balanced inequality ratio P1 =0.071 538 3
Right balanced inequality ratio P2 =0.304 438
Relative edge distribution entropy Her =0.722 635
Power law exponent γ =4.619 95
Tail power law exponent γt =3.131 00
Tail power law exponent with p γ3 =3.131 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.611 00
Left p-value p1 =0.490 000
Right tail power law exponent with p γ3,2 =3.951 00
Right p-value p2 =0.044 000 0
Spectral norm α =353.711
Algebraic connectivity a =0.029 494 8
Spectral separation 1[A] / λ2[A]| =1.206 02
Controllability C =16,194
Relative controllability Cr =0.945 580

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.