Wikiquote edits (gl)

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


Internal nameedit-glwikisource
NameWikiquote edits (gl)
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 =3,254
Left size n1 =371
Right size n2 =2,883
Volume m =12,453
Unique edge count m̿ =5,543
Wedge count s =1,142,455
Claw count z =339,719,905
Cross count x =92,029,800,870
Square count q =118,522
4-Tour count T4 =5,530,478
Maximum degree dmax =2,918
Maximum left degree d1max =2,918
Maximum right degree d2max =235
Average degree d =7.653 96
Average left degree d1 =33.566 0
Average right degree d2 =4.319 46
Fill p =0.005 182 35
Average edge multiplicity m̃ =2.246 62
Size of LCC N =3,004
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.375 90
90-Percentile effective diameter δ0.9 =5.345 90
Median distance δM =4
Mean distance δm =3.818 59
Gini coefficient G =0.769 968
Balanced inequality ratio P =0.193 327
Left balanced inequality ratio P1 =0.092 989 6
Right balanced inequality ratio P2 =0.264 515
Relative edge distribution entropy Her =0.784 487
Power law exponent γ =3.123 68
Tail power law exponent γt =2.481 00
Tail power law exponent with p γ3 =2.481 00
p-value p =0.010 000 0
Left tail power law exponent with p γ3,1 =1.731 00
Left p-value p1 =0.679 000
Right tail power law exponent with p γ3,2 =2.791 00
Right p-value p2 =0.034 000 0
Degree assortativity ρ =−0.227 392
Degree assortativity p-value pρ =6.180 50 × 10−66
Spectral norm α =184.616
Algebraic connectivity a =0.023 322 4
Spectral separation 1[A] / λ2[A]| =1.199 98
Controllability C =2,634
Relative controllability Cr =0.812 963


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.