Wikipedia links (fy)

This network consists of the wikilinks of the Wikipedia in the Western Frisian language (fy). 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_fy
NameWikipedia links (fy)
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 =65,562
Volume m =1,071,678
Loop count l =10
Wedge count s =283,539,732
Claw count z =174,087,862,737
Cross count x =126,927,945,860,531
Triangle count t =5,573,549
Square count q =1,114,116,910
4-Tour count T4 =9,921,126,732
Maximum degree dmax =5,367
Maximum outdegree d+max =2,784
Maximum indegree dmax =5,110
Average degree d =32.692 0
Fill p =0.000 253 893
Size of LCC N =65,512
Size of LSCC Ns =45,688
Relative size of LSCC Nrs =0.710 898
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.085 79
90-Percentile effective diameter δ0.9 =3.963 16
Median distance δM =4
Mean distance δm =3.576 55
Gini coefficient G =0.740 796
Balanced inequality ratio P =0.214 541
Outdegree balanced inequality ratio P+ =0.228 120
Indegree balanced inequality ratio P =0.181 618
Relative edge distribution entropy Her =0.888 850
Power law exponent γ =1.473 35
Tail power law exponent γt =2.301 00
Degree assortativity ρ =−0.118 488
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.627 932
Clustering coefficient c =0.058 971 1
Directed clustering coefficient c± =0.219 581
Spectral norm α =318.264
Operator 2-norm ν =205.601
Cyclic eigenvalue π =154.578
Reciprocity y =0.281 436
Non-bipartivity bA =0.378 236
Normalized non-bipartivity bN =0.062 094 0
Spectral bipartite frustration bK =0.000 988 846


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 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 ]