Wikibooks edits (hr)

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


Internal nameedit-hrwikibooks
NameWikibooks 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,771
Left size n1 =277
Right size n2 =3,494
Volume m =12,757
Unique edge count m̿ =6,031
Wedge count s =1,807,248
Claw count z =615,121,532
Cross count x =186,636,772,891
Square count q =262,764
4-Tour count T4 =9,353,954
Maximum degree dmax =4,163
Maximum left degree d1max =4,163
Maximum right degree d2max =207
Average degree d =6.765 84
Average left degree d1 =46.054 2
Average right degree d2 =3.651 12
Fill p =0.006 231 41
Average edge multiplicity m̃ =2.115 24
Size of LCC N =3,580
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.358 59
90-Percentile effective diameter δ0.9 =4.251 94
Median distance δM =4
Mean distance δm =3.675 30
Gini coefficient G =0.734 953
Balanced inequality ratio P =0.219 409
Left balanced inequality ratio P1 =0.081 210 3
Right balanced inequality ratio P2 =0.317 159
Relative edge distribution entropy Her =0.758 366
Power law exponent γ =3.176 58
Tail power law exponent γt =3.381 00
Tail power law exponent with p γ3 =3.381 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.721 00
Left p-value p1 =0.573 000
Right tail power law exponent with p γ3,2 =4.001 00
Right p-value p2 =0.069 000 0
Degree assortativity ρ =−0.158 908
Degree assortativity p-value pρ =2.109 99 × 10−35
Spectral norm α =173.331
Spectral separation 1[A] / λ2[A]| =1.172 42
Controllability C =3,241
Relative controllability Cr =0.862 656


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.