Wikipedia links (ba)

This network consists of the wikilinks of the Wikipedia in the Bashkir language (ba). Nodes are Wikipedia articles, and directed edges are wikilinks, i.e., hyperlinks within one wiki. In the wiki source, these are indicated with [[double brackets]]. Only pages in the article namespace are included.


Internal namewikipedia_link_ba
NameWikipedia links (ba)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops


Size n =48,684
Volume m =1,181,730
Loop count l =218
Wedge count s =1,878,442,810
Claw count z =11,328,545,336,183
Cross count x =62,856,287,057,643,976
Triangle count t =25,360,565
Square count q =10,190,317,014
4-Tour count T4 =89,038,016,864
Maximum degree dmax =28,394
Maximum outdegree d+max =697
Maximum indegree dmax =28,393
Average degree d =48.547 0
Fill p =0.000 498 593
Size of LCC N =48,669
Size of LSCC Ns =16,838
Relative size of LSCC Nrs =0.345 863
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.228 12
90-Percentile effective diameter δ0.9 =3.619 61
Mean distance δm =2.829 14
Gini coefficient G =0.789 769
Relative edge distribution entropy Her =0.848 124
Power law exponent γ =1.432 00
Tail power law exponent γt =1.801 00
Degree assortativity ρ =−0.133 977
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.706 146
Clustering coefficient c =0.040 502 5
Directed clustering coefficient c± =0.818 196
Spectral norm α =747.831
Operator 2-norm ν =382.663
Cyclic eigenvalue π =365.812
Algebraic connectivity a =0.144 115
Reciprocity y =0.553 197
Non-bipartivity bA =0.543 563
Normalized non-bipartivity bN =0.087 027 9
Spectral bipartite frustration bK =0.001 025 35


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

Delaunay graph drawing

In/outdegree scatter plot

Clustering coefficient distribution

Average neighbor degree distribution


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 ]