Wikiquote edits (sa)

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


Internal nameedit-sawikisource
NameWikiquote edits (sa)
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 =50,410
Left size n1 =856
Right size n2 =49,554
Volume m =106,991
Unique edge count m̿ =72,614
Wedge count s =115,912,503
Claw count z =233,652,696,785
Cross count x =441,930,818,309,262
Square count q =10,646,318
4-Tour count T4 =548,977,948
Maximum degree dmax =16,933
Maximum left degree d1max =16,933
Maximum right degree d2max =296
Average degree d =4.244 83
Average left degree d1 =124.989
Average right degree d2 =2.159 08
Fill p =0.001 711 86
Average edge multiplicity m̃ =1.473 42
Size of LCC N =47,643
Diameter δ =16
50-Percentile effective diameter δ0.5 =5.205 50
90-Percentile effective diameter δ0.9 =5.925 15
Median distance δM =6
Mean distance δm =5.199 93
Gini coefficient G =0.715 859
Balanced inequality ratio P =0.214 794
Left balanced inequality ratio P1 =0.076 165 3
Right balanced inequality ratio P2 =0.320 466
Relative edge distribution entropy Her =0.735 198
Power law exponent γ =4.724 50
Tail power law exponent γt =2.561 00
Tail power law exponent with p γ3 =2.561 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.531 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =2.621 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.224 174
Degree assortativity p-value pρ =0.000 00
Spectral norm α =281.218
Algebraic connectivity a =0.002 789 75
Spectral separation 1[A] / λ2[A]| =1.689 23
Controllability C =48,208
Relative controllability Cr =0.967 721


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.