Wikipedia links (arz)

This network consists of the wikilinks of the Wikipedia in the Egyptian Arabic language (arz). 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_arz
NameWikipedia links (arz)
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,958
Volume m =502,048
Loop count l =4
Wedge count s =105,375,646
Claw count z =74,686,238,549
Cross count x =76,972,028,838,503
Triangle count t =16,028,116
Square count q =3,433,949,843
4-Tour count T4 =25,911,689,124
Maximum degree dmax =6,384
Maximum outdegree d+max =2,186
Maximum indegree dmax =6,383
Average degree d =40.231 4
Fill p =0.000 824 806
Size of LCC N =24,678
Size of LSCC Ns =16,055
Relative size of LSCC Nrs =0.663 183
Diameter δ =11
50-Percentile effective diameter δ0.5 =2.912 42
90-Percentile effective diameter δ0.9 =4.006 52
Median distance δM =3
Mean distance δm =3.468 88
Gini coefficient G =0.814 297
Balanced inequality ratio P =0.158 958
Outdegree balanced inequality ratio P+ =0.158 943
Indegree balanced inequality ratio P =0.159 827
Relative edge distribution entropy Her =0.852 115
Power law exponent γ =1.526 14
Tail power law exponent γt =1.591 00
Degree assortativity ρ =−0.044 571 0
Degree assortativity p-value pρ =2.485 15 × 10−320
In/outdegree correlation ρ± =+0.676 070
Clustering coefficient c =0.456 314
Directed clustering coefficient c± =0.796 496
Spectral norm α =491.007
Operator 2-norm ν =294.435
Cyclic eigenvalue π =220.008
Algebraic connectivity a =0.084 657 9
Reciprocity y =0.476 861
Non-bipartivity bA =0.797 182
Normalized non-bipartivity bN =0.055 940 9
Spectral bipartite frustration bK =0.000 767 947


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 ]