Wikiquote edits (ro)

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


Internal nameedit-rowikiquote
NameWikiquote edits (ro)
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,557
Left size n1 =472
Right size n2 =3,085
Volume m =12,781
Unique edge count m̿ =6,902
Wedge count s =841,103
Claw count z =148,323,090
Cross count x =26,926,272,980
Square count q =321,529
4-Tour count T4 =5,959,380
Maximum degree dmax =1,833
Maximum left degree d1max =1,833
Maximum right degree d2max =634
Average degree d =7.186 39
Average left degree d1 =27.078 4
Average right degree d2 =4.142 95
Fill p =0.004 739 99
Average edge multiplicity m̃ =1.851 78
Size of LCC N =3,250
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.504 53
90-Percentile effective diameter δ0.9 =5.344 78
Median distance δM =4
Mean distance δm =4.023 76
Gini coefficient G =0.787 072
Balanced inequality ratio P =0.179 211
Left balanced inequality ratio P1 =0.123 152
Right balanced inequality ratio P2 =0.245 521
Relative edge distribution entropy Her =0.807 424
Power law exponent γ =2.912 88
Tail power law exponent γt =2.061 00
Tail power law exponent with p γ3 =2.061 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.661 00
Left p-value p1 =0.244 000
Right tail power law exponent with p γ3,2 =2.171 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.211 271
Degree assortativity p-value pρ =1.736 95 × 10−70
Spectral norm α =313.318
Algebraic connectivity a =0.036 592 7
Spectral separation 1[A] / λ2[A]| =2.394 10
Controllability C =2,677
Relative controllability Cr =0.759 433


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.