Wikipedia links (xal)

This network consists of the wikilinks of the Wikipedia in the Kalmyk language (xal). 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_xal
NameWikipedia links (xal)
Data source
AvailabilityDataset is available for download
Consistency checkDataset failed tests: *** No loop found although #loop is set
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 =2,689
Volume m =231,111
Loop count l =0
Wedge count s =36,230,237
Claw count z =29,852,628,806
Cross count x =5,164,819,460,118
Triangle count t =11,930,751
Square count q =2,993,548,104
4-Tour count T4 =24,093,551,178
Maximum degree dmax =748
Maximum outdegree d+max =383
Maximum indegree dmax =408
Average degree d =171.894
Fill p =0.031 974 3
Size of LCC N =2,585
Size of LSCC Ns =1,169
Relative size of LSCC Nrs =0.434 734
Diameter δ =15
50-Percentile effective diameter δ0.5 =4.065 56
90-Percentile effective diameter δ0.9 =6.048 82
Median distance δM =5
Mean distance δm =4.530 55
Gini coefficient G =0.731 577
Relative edge distribution entropy Her =0.862 027
Power law exponent γ =1.400 78
Tail power law exponent γt =1.331 00
Degree assortativity ρ =+0.930 459
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.902 096
Clustering coefficient c =0.987 911
Directed clustering coefficient c± =0.995 894
Spectral norm α =736.547
Operator 2-norm ν =371.385
Cyclic eigenvalue π =365.001
Algebraic connectivity a =0.006 342 82
Reciprocity y =0.938 181
Non-bipartivity bA =0.965 375
Normalized non-bipartivity bN =0.010 127 0
Spectral bipartite frustration bK =5.249 89 × 10−5


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

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 ]