Wikiquote edits (sa)

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


Internal nameedit-sawikiquote
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 =4,637
Left size n1 =154
Right size n2 =4,483
Volume m =14,598
Unique edge count m̿ =7,216
Wedge count s =5,130,009
Claw count z =3,601,372,842
Cross count x =2,093,475,638,727
Square count q =1,055,403
4-Tour count T4 =28,992,436
Maximum degree dmax =6,210
Maximum left degree d1max =6,210
Maximum right degree d2max =127
Average degree d =6.296 31
Average left degree d1 =94.792 2
Average right degree d2 =3.256 30
Fill p =0.010 452 2
Average edge multiplicity m̃ =2.023 00
Size of LCC N =4,461
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.267 84
90-Percentile effective diameter δ0.9 =5.424 40
Median distance δM =4
Mean distance δm =3.618 84
Gini coefficient G =0.661 413
Balanced inequality ratio P =0.259 077
Left balanced inequality ratio P1 =0.067 132 5
Right balanced inequality ratio P2 =0.383 409
Relative edge distribution entropy Her =0.708 630
Power law exponent γ =3.480 19
Tail power law exponent γt =3.791 00
Tail power law exponent with p γ3 =3.791 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.481 00
Left p-value p1 =0.414 000
Right tail power law exponent with p γ3,2 =8.441 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.027 350 1
Degree assortativity p-value pρ =0.020 160 7
Spectral norm α =203.371
Algebraic connectivity a =0.006 447 95
Spectral separation 1[A] / λ2[A]| =1.354 33
Controllability C =4,327
Relative controllability Cr =0.935 568


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.