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,658
Volume m =122,738
Loop count l =1
Wedge count s =132,365,715
Claw count z =398,445,448,661
Cross count x =955,668,996,506,904
Triangle count t =403,177
Square count q =121,727,524
4-Tour count T4 =1,503,494,010
Maximum degree dmax =10,436
Maximum outdegree d+max =207
Maximum indegree dmax =10,285
Average degree d =11.334 2
Fill p =0.000 261 663
Size of LCC N =21,572
Size of LSCC Ns =15,185
Relative size of LSCC Nrs =0.701 127
Diameter δ =13
50-Percentile effective diameter δ0.5 =2.886 57
90-Percentile effective diameter δ0.9 =4.521 73
Median distance δM =3
Mean distance δm =3.419 95
Gini coefficient G =0.663 041
Relative edge distribution entropy Her =0.841 264
Power law exponent γ =1.680 75
Tail power law exponent γt =2.111 00
Degree assortativity ρ =−0.161 519
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.507 310
Clustering coefficient c =0.009 137 80
Directed clustering coefficient c± =0.252 514
Spectral norm α =164.400
Operator 2-norm ν =159.431
Cyclic eigenvalue π =73.143 5
Algebraic connectivity a =0.083 246 0
Reciprocity y =0.281 225
Non-bipartivity bA =0.036 520 9
Normalized non-bipartivity bN =0.048 975 7
Spectral bipartite frustration bK =0.002 128 95


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 ]