Wikiquote edits (hr)

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


Internal nameedit-hrwikiquote
NameWikiquote edits (hr)
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,762
Left size n1 =398
Right size n2 =3,364
Volume m =17,950
Unique edge count m̿ =8,439
Wedge count s =1,625,186
Claw count z =372,786,062
Cross count x =80,774,164,065
Square count q =800,407
4-Tour count T4 =12,924,102
Maximum degree dmax =5,751
Maximum left degree d1max =5,751
Maximum right degree d2max =760
Average degree d =9.542 80
Average left degree d1 =45.100 5
Average right degree d2 =5.335 91
Fill p =0.006 303 07
Average edge multiplicity m̃ =2.127 03
Size of LCC N =3,545
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.459 14
90-Percentile effective diameter δ0.9 =5.534 48
Median distance δM =4
Mean distance δm =4.012 49
Gini coefficient G =0.815 752
Balanced inequality ratio P =0.163 315
Left balanced inequality ratio P1 =0.094 874 7
Right balanced inequality ratio P2 =0.220 557
Relative edge distribution entropy Her =0.783 667
Power law exponent γ =2.707 95
Tail power law exponent γt =1.981 00
Tail power law exponent with p γ3 =1.981 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.641 00
Left p-value p1 =0.182 000
Right tail power law exponent with p γ3,2 =2.051 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.216 179
Degree assortativity p-value pρ =8.298 93 × 10−90
Spectral norm α =853.336
Algebraic connectivity a =0.020 985 8
Spectral separation 1[A] / λ2[A]| =8.850 84
Controllability C =3,006
Relative controllability Cr =0.802 885


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.