Wikiquote edits (as)

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

Metadata

Codeqas
Internal nameedit-aswikisource
NameWikiquote edits (as)
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 =3,912
Left size n1 =325
Right size n2 =3,587
Volume m =10,320
Unique edge count m̿ =5,585
Wedge count s =1,548,390
Claw count z =471,519,942
Cross count x =127,540,143,904
Square count q =81,013
4-Tour count T4 =6,859,866
Maximum degree dmax =2,479
Maximum left degree d1max =2,479
Maximum right degree d2max =209
Average degree d =5.276 07
Average left degree d1 =31.753 8
Average right degree d2 =2.877 06
Fill p =0.004 790 80
Average edge multiplicity m̃ =1.847 81
Size of LCC N =3,764
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.433 92
90-Percentile effective diameter δ0.9 =4.664 28
Median distance δM =4
Mean distance δm =3.826 24
Gini coefficient G =0.749 095
Relative edge distribution entropy Her =0.755 103
Power law exponent γ =3.969 29
Tail power law exponent γt =3.171 00
Degree assortativity ρ =−0.238 707
Degree assortativity p-value pρ =3.336 98 × 10−73
Spectral norm α =309.201
Algebraic connectivity a =0.010 801 1

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.