Wikiquote edits (bs)

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


Internal nameedit-bswikisource
NameWikiquote edits (bs)
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,347
Left size n1 =263
Right size n2 =3,084
Volume m =7,625
Unique edge count m̿ =4,178
Wedge count s =946,055
Claw count z =276,894,551
Cross count x =69,944,669,498
Square count q =60,583
4-Tour count T4 =4,281,628
Maximum degree dmax =2,402
Maximum left degree d1max =2,402
Maximum right degree d2max =205
Average degree d =4.556 32
Average left degree d1 =28.992 4
Average right degree d2 =2.472 44
Fill p =0.005 151 08
Average edge multiplicity m̃ =1.825 04
Size of LCC N =2,930
Diameter δ =15
50-Percentile effective diameter δ0.5 =3.700 64
90-Percentile effective diameter δ0.9 =7.547 96
Median distance δM =4
Mean distance δm =4.752 46
Gini coefficient G =0.715 314
Balanced inequality ratio P =0.223 344
Left balanced inequality ratio P1 =0.105 049
Right balanced inequality ratio P2 =0.331 279
Relative edge distribution entropy Her =0.772 745
Power law exponent γ =4.337 54
Tail power law exponent γt =2.471 00
Tail power law exponent with p γ3 =2.471 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.721 00
Left p-value p1 =0.345 000
Right tail power law exponent with p γ3,2 =4.491 00
Right p-value p2 =0.385 000
Degree assortativity ρ =−0.167 588
Degree assortativity p-value pρ =1.073 67 × 10−27
Spectral norm α =208.448
Algebraic connectivity a =0.007 836 23
Spectral separation 1[A] / λ2[A]| =2.034 93
Controllability C =2,690
Relative controllability Cr =0.844 319


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.