Wikipedia links (bat-smg)

This network consists of the wikilinks of the Wikipedia in the Samogitian language (bat-smg). 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_bat_smg
NameWikipedia links (bat-smg)
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 =21,900
Volume m =123,807
Loop count l =1
Wedge count s =132,203,216
Claw count z =397,415,766,890
Cross count x =952,020,642,358,457
Triangle count t =405,990
Square count q =122,071,539
4-Tour count T4 =1,505,598,656
Maximum degree dmax =10,414
Maximum outdegree d+max =207
Maximum indegree dmax =10,263
Average degree d =11.306 6
Fill p =0.000 258 141
Size of LCC N =21,814
Size of LSCC Ns =15,272
Relative size of LSCC Nrs =0.697 352
Diameter δ =13
50-Percentile effective diameter δ0.5 =2.929 94
90-Percentile effective diameter δ0.9 =4.687 27
Median distance δM =3
Mean distance δm =3.516 91
Gini coefficient G =0.662 534
Balanced inequality ratio P =0.257 376
Outdegree balanced inequality ratio P+ =0.322 946
Indegree balanced inequality ratio P =0.153 408
Relative edge distribution entropy Her =0.842 366
Power law exponent γ =1.680 30
Tail power law exponent γt =2.121 00
Degree assortativity ρ =−0.159 354
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.501 246
Clustering coefficient c =0.009 212 86
Directed clustering coefficient c± =0.248 788
Operator 2-norm ν =159.406
Spectral separation 1[A] / λ2[A]| =1.042 83
Reciprocity y =0.275 695
Non-bipartivity bA =0.041 069 0
Controllability C =14,067
Relative controllability Cr =0.642 329


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 ]