Wikibooks edits (sr)

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


Internal nameedit-srwikibooks
NameWikibooks edits (sr)
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,308
Left size n1 =331
Right size n2 =2,977
Volume m =7,700
Unique edge count m̿ =3,647
Wedge count s =393,188
Claw count z =58,702,246
Cross count x =7,760,363,357
Square count q =16,507
4-Tour count T4 =1,712,638
Maximum degree dmax =1,212
Maximum left degree d1max =1,212
Maximum right degree d2max =174
Average degree d =4.655 38
Average left degree d1 =23.262 8
Average right degree d2 =2.586 50
Fill p =0.003 701 08
Average edge multiplicity m̃ =2.111 32
Size of LCC N =2,914
Diameter δ =15
50-Percentile effective diameter δ0.5 =5.323 27
90-Percentile effective diameter δ0.9 =7.762 76
Median distance δM =6
Mean distance δm =5.703 48
Gini coefficient G =0.703 824
Balanced inequality ratio P =0.227 922
Left balanced inequality ratio P1 =0.143 377
Right balanced inequality ratio P2 =0.328 312
Relative edge distribution entropy Her =0.810 743
Power law exponent γ =5.303 35
Tail power law exponent γt =2.681 00
Tail power law exponent with p γ3 =2.681 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.861 00
Left p-value p1 =0.005 000 00
Right tail power law exponent with p γ3,2 =4.421 00
Right p-value p2 =0.011 000 0
Degree assortativity ρ =−0.181 894
Degree assortativity p-value pρ =1.688 76 × 10−28
Spectral norm α =157.817
Algebraic connectivity a =0.013 386 2
Spectral separation 1[A] / λ2[A]| =1.676 67
Controllability C =2,582
Relative controllability Cr =0.805 868


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.