Wikinews edits (bg)

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


Internal nameedit-bgwikinews
NameWikinews edits (bg)
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 =4,457
Left size n1 =324
Right size n2 =4,133
Volume m =13,336
Unique edge count m̿ =5,942
Wedge count s =2,483,238
Claw count z =1,285,607,469
Cross count x =561,769,326,601
Square count q =109,671
4-Tour count T4 =10,823,760
Maximum degree dmax =3,549
Maximum left degree d1max =3,549
Maximum right degree d2max =2,187
Average degree d =5.984 29
Average left degree d1 =41.160 5
Average right degree d2 =3.226 71
Fill p =0.004 437 34
Average edge multiplicity m̃ =2.244 36
Size of LCC N =4,166
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.543 09
90-Percentile effective diameter δ0.9 =6.627 93
Median distance δM =4
Mean distance δm =4.298 76
Gini coefficient G =0.806 993
Balanced inequality ratio P =0.163 805
Left balanced inequality ratio P1 =0.083 983 2
Right balanced inequality ratio P2 =0.244 976
Relative edge distribution entropy Her =0.745 665
Power law exponent γ =4.936 90
Tail power law exponent γt =2.611 00
Tail power law exponent with p γ3 =2.611 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.751 00
Left p-value p1 =0.689 000
Right tail power law exponent with p γ3,2 =2.791 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.337 305
Degree assortativity p-value pρ =4.922 27 × 10−158
Spectral norm α =2,172.05
Algebraic connectivity a =0.008 358 51
Spectral separation 1[A] / λ2[A]| =1.453 95
Controllability C =3,846
Relative controllability Cr =0.866 216


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.