Wikipedia links (am)

This network consists of the wikilinks of the Wikipedia in the Amharic language (am). 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_am
NameWikipedia links (am)
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 =20,497
Volume m =102,357
Loop count l =6
Wedge count s =22,259,956
Claw count z =15,518,630,044
Cross count x =11,947,617,925,892
Triangle count t =309,418
Square count q =27,531,400
4-Tour count T4 =309,472,746
Maximum degree dmax =3,912
Maximum outdegree d+max =1,262
Maximum indegree dmax =3,855
Average degree d =9.987 51
Fill p =0.000 243 633
Size of LCC N =20,442
Size of LSCC Ns =8,402
Relative size of LSCC Nrs =0.409 914
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.514 95
90-Percentile effective diameter δ0.9 =5.069 18
Median distance δM =4
Mean distance δm =4.065 11
Gini coefficient G =0.730 614
Relative edge distribution entropy Her =0.851 753
Power law exponent γ =1.807 39
Tail power law exponent γt =2.571 00
Degree assortativity ρ =−0.123 643
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.504 033
Clustering coefficient c =0.041 700 6
Directed clustering coefficient c± =0.317 029
Spectral norm α =135.631
Operator 2-norm ν =77.910 1
Cyclic eigenvalue π =62.481 5
Algebraic connectivity a =0.057 313 0
Reciprocity y =0.224 567
Non-bipartivity bA =0.461 409
Normalized non-bipartivity bN =0.015 123 9
Spectral bipartite frustration bK =0.001 692 34


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 ]