Wikipedia links (se)

This network consists of the wikilinks of the Wikipedia in the Northern Sami language (se). 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_se
NameWikipedia links (se)
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 =8,542
Volume m =259,536
Loop count l =10
Wedge count s =15,918,856
Claw count z =3,139,386,128
Cross count x =238,149,830,734
Triangle count t =3,866,559
Square count q =325,972,846
4-Tour count T4 =2,671,772,294
Maximum degree dmax =987
Maximum outdegree d+max =441
Maximum indegree dmax =895
Average degree d =60.767 0
Fill p =0.003 556 96
Size of LCC N =8,338
Size of LSCC Ns =5,334
Relative size of LSCC Nrs =0.624 444
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.381 33
90-Percentile effective diameter δ0.9 =4.778 69
Median distance δM =4
Mean distance δm =3.915 81
Gini coefficient G =0.651 508
Relative edge distribution entropy Her =0.914 663
Power law exponent γ =1.403 35
Tail power law exponent γt =1.331 00
Degree assortativity ρ =+0.046 637 7
Degree assortativity p-value pρ =9.323 73 × 10−151
In/outdegree correlation ρ± =+0.822 451
Clustering coefficient c =0.728 675
Directed clustering coefficient c± =0.920 462
Spectral norm α =241.373
Operator 2-norm ν =141.799
Cyclic eigenvalue π =100.895
Algebraic connectivity a =0.036 442 1
Reciprocity y =0.789 717
Non-bipartivity bA =0.713 546
Normalized non-bipartivity bN =0.028 803 9
Spectral bipartite frustration bK =0.000 342 866


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 ]