Wikiquote edits (gu)

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


Internal nameedit-guwikisource
NameWikiquote edits (gu)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
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


Size n =16,580
Left size n1 =385
Right size n2 =16,195
Volume m =69,559
Unique edge count m̿ =32,454
Wedge count s =101,784,838
Claw count z =353,785,871,769
Cross count x =1,040,489,937,951,775
Square count q =19,317,302
4-Tour count T4 =561,808,460
Maximum degree dmax =33,538
Maximum left degree d1max =33,538
Maximum right degree d2max =832
Average degree d =8.390 71
Average left degree d1 =180.673
Average right degree d2 =4.295 09
Fill p =0.005 205 07
Average edge multiplicity m̃ =2.143 31
Size of LCC N =16,412
Diameter δ =10
50-Percentile effective diameter δ0.5 =1.821 39
90-Percentile effective diameter δ0.9 =3.790 66
Median distance δM =2
Mean distance δm =2.812 19
Gini coefficient G =0.720 906
Balanced inequality ratio P =0.229 841
Left balanced inequality ratio P1 =0.047 628 6
Right balanced inequality ratio P2 =0.346 540
Relative edge distribution entropy Her =0.684 960
Power law exponent γ =2.702 54
Tail power law exponent γt =3.521 00
Degree assortativity ρ =−0.196 912
Degree assortativity p-value pρ =4.744 97 × 10−281
Spectral norm α =818.048
Algebraic connectivity a =0.036 153 3
Spectral separation 1[A] / λ2[A]| =3.099 04
Controllability C =16,023
Relative controllability Cr =0.967 865


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



[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., January 2010.