Wikipedia links (yi)

This network consists of the wikilinks of the Wikipedia in the Yiddish language (yi). 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_yi
NameWikipedia links (yi)
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 =24,897
Volume m =684,965
Loop count l =47
Wedge count s =238,421,424
Claw count z =49,781,159,915
Cross count x =8,542,429,681,223
Triangle count t =4,171,820
Square count q =25,996,570,661
4-Tour count T4 =208,927,469,248
Maximum degree dmax =2,138
Maximum outdegree d+max =1,042
Maximum indegree dmax =2,043
Average degree d =55.023 9
Fill p =0.001 105 03
Size of LCC N =24,871
Size of LSCC Ns =15,960
Relative size of LSCC Nrs =0.641 041
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.051 07
90-Percentile effective diameter δ0.9 =4.080 62
Median distance δM =4
Mean distance δm =3.573 21
Gini coefficient G =0.804 703
Relative edge distribution entropy Her =0.861 025
Power law exponent γ =1.459 81
Tail power law exponent γt =1.761 00
Degree assortativity ρ =+0.551 796
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.443 730
Clustering coefficient c =0.052 493 0
Directed clustering coefficient c± =0.485 592
Spectral norm α =575.887
Operator 2-norm ν =566.820
Cyclic eigenvalue π =82.428 9
Algebraic connectivity a =0.106 582
Reciprocity y =0.221 353
Non-bipartivity bA =0.028 610 1
Normalized non-bipartivity bN =0.032 615 5
Spectral bipartite frustration bK =0.000 525 729


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 ]