Wikiquote edits (gu)

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

Metadata

Codeqgu
Internal nameedit-guwikiquote
NameWikiquote edits (gu)
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 =2,649
Left size n1 =963
Right size n2 =1,686
Volume m =11,364
Unique edge count m̿ =5,502
Wedge count s =794,579
Claw count z =184,039,364
Cross count x =40,907,686,841
Square count q =291,739
4-Tour count T4 =5,524,224
Maximum degree dmax =1,344
Maximum left degree d1max =1,344
Maximum right degree d2max =248
Average degree d =8.579 84
Average left degree d1 =11.800 6
Average right degree d2 =6.740 21
Fill p =0.003 388 73
Average edge multiplicity m̃ =2.065 43
Size of LCC N =2,458
Diameter δ =15
50-Percentile effective diameter δ0.5 =3.201 88
90-Percentile effective diameter δ0.9 =5.866 52
Median distance δM =4
Mean distance δm =4.005 16
Gini coefficient G =0.716 720
Relative edge distribution entropy Her =0.809 759
Power law exponent γ =2.555 05
Tail power law exponent γt =2.031 00
Tail power law exponent with p γ3 =2.031 00
p-value p =0.838 000
Left tail power law exponent with p γ3,1 =2.111 00
Left p-value p1 =0.009 000 00
Right tail power law exponent with p γ3,2 =2.651 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.348 980
Degree assortativity p-value pρ =2.442 94 × 10−157
Spectral norm α =179.072
Algebraic connectivity a =0.006 848 45

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.