Wikipedia links (bar)

This network consists of the wikilinks of the Wikipedia in the Bavarian language (bar). 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_bar
NameWikipedia links (bar)
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 =40,757
Volume m =664,036
Loop count l =279
Wedge count s =137,552,856
Claw count z =98,174,140,445
Cross count x =94,414,983,354,847
Triangle count t =2,209,635
Square count q =1,922,754,199
4-Tour count T4 =15,657,535,356
Maximum degree dmax =5,859
Maximum outdegree d+max =2,830
Maximum indegree dmax =4,315
Average degree d =32.585 1
Fill p =0.000 455 711
Size of LCC N =40,618
Size of LSCC Ns =26,777
Relative size of LSCC Nrs =0.716 058
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.320 27
90-Percentile effective diameter δ0.9 =4.549 63
Median distance δM =4
Mean distance δm =3.811 30
Gini coefficient G =0.689 860
Balanced inequality ratio P =0.228 172
Outdegree balanced inequality ratio P+ =0.212 954
Indegree balanced inequality ratio P =0.186 960
Relative edge distribution entropy Her =0.908 134
Power law exponent γ =1.436 44
Tail power law exponent γt =1.861 00
Degree assortativity ρ =−0.091 842 1
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.182 226
Clustering coefficient c =0.048 191 7
Directed clustering coefficient c± =0.233 156
Spectral norm α =263.115
Operator 2-norm ν =258.401
Cyclic eigenvalue π =85.038 7
Algebraic connectivity a =0.095 667 0
Reciprocity y =0.199 901
Non-bipartivity bA =0.024 711 8
Normalized non-bipartivity bN =0.011 263 9
Spectral bipartite frustration bK =0.000 628 166


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 ]