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.

Metadata

CodeWam
Internal namewikipedia_link_am
NameWikipedia links (am)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =20,943
Volume m =105,746
Loop count l =6
Wedge count s =22,670,659
Claw count z =15,762,905,610
Cross count x =12,174,712,666,395
Triangle count t =317,577
Square count q =27,903,332
4-Tour count T4 =314,097,410
Maximum degree dmax =3,931
Maximum outdegree d+max =1,296
Maximum indegree dmax =3,866
Average degree d =10.098 5
Fill p =0.000 241 094
Size of LCC N =20,883
Size of LSCC Ns =8,717
Relative size of LSCC Nrs =0.416 225
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.605 29
90-Percentile effective diameter δ0.9 =5.290 89
Median distance δM =4
Mean distance δm =4.154 00
Gini coefficient G =0.729 476
Balanced inequality ratio P =0.207 625
Outdegree balanced inequality ratio P+ =0.218 287
Indegree balanced inequality ratio P =0.184 404
Relative edge distribution entropy Her =0.853 504
Power law exponent γ =1.797 91
Tail power law exponent γt =2.591 00
Tail power law exponent with p γ3 =2.591 00
p-value p =0.034 000 0
Outdegree tail power law exponent with p γ3,o =2.831 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =1.881 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.121 040
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.501 462
Clustering coefficient c =0.042 024 8
Directed clustering coefficient c± =0.309 710
Cyclic eigenvalue π =62.534 4
Algebraic connectivity a =0.060 766 5
Spectral separation 1[A] / λ2[A]| =1.202 35
Reciprocity y =0.220 982
Non-bipartivity bA =0.463 072
Normalized non-bipartivity bN =0.015 584 4
Algebraic non-bipartivity χ =0.061 934 2
Spectral bipartite frustration bK =0.001 719 40
Controllability C =11,633
Relative controllability Cr =0.555 460

Plots

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

SynGraphy

Matrix decompositions plots

Downloads

References

[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]