Wikipedia links (ps)

This network consists of the wikilinks of the Wikipedia in the Pashto language (ps). 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_ps
NameWikipedia links (ps)
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 =10,326
Volume m =277,062
Loop count l =22
Wedge count s =40,968,662
Claw count z =28,578,210,511
Cross count x =5,310,799,184,211
Triangle count t =11,465,407
Square count q =2,975,970,794
4-Tour count T4 =23,971,998,988
Maximum degree dmax =1,449
Maximum outdegree d+max =395
Maximum indegree dmax =1,277
Average degree d =53.663 0
Fill p =0.002 598 44
Size of LCC N =10,051
Size of LSCC Ns =4,924
Relative size of LSCC Nrs =0.476 855
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.635 48
90-Percentile effective diameter δ0.9 =5.092 59
Median distance δM =4
Mean distance δm =4.185 81
Gini coefficient G =0.834 593
Relative edge distribution entropy Her =0.827 376
Power law exponent γ =1.532 44
Tail power law exponent γt =1.501 00
Degree assortativity ρ =+0.564 464
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.721 931
Clustering coefficient c =0.839 574
Directed clustering coefficient c± =0.979 299
Spectral norm α =747.163
Operator 2-norm ν =377.989
Cyclic eigenvalue π =369.000
Algebraic connectivity a =0.067 527 2
Reciprocity y =0.707 834
Non-bipartivity bA =0.867 492
Normalized non-bipartivity bN =0.033 511 9
Spectral bipartite frustration bK =0.000 500 617


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

Double Laplacian graph drawing

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 ]