Wikipedia links (pa)

This network consists of the wikilinks of the Wikipedia in the Punjabi language (pa). 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_pa
NameWikipedia links (pa)
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 =38,059
Volume m =515,908
Loop count l =95
Wedge count s =145,104,782
Claw count z =165,499,892,373
Cross count x =239,388,423,079,324
Triangle count t =10,058,727
Square count q =1,726,581,829
4-Tour count T4 =14,393,913,196
Maximum degree dmax =8,061
Maximum outdegree d+max =611
Maximum indegree dmax =7,825
Average degree d =27.111 0
Fill p =0.000 356 170
Size of LCC N =37,409
Size of LSCC Ns =17,371
Relative size of LSCC Nrs =0.456 423
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.466 41
90-Percentile effective diameter δ0.9 =4.780 18
Median distance δM =4
Mean distance δm =3.969 80
Gini coefficient G =0.799 722
Relative edge distribution entropy Her =0.857 491
Power law exponent γ =1.577 71
Tail power law exponent γt =1.781 00
Degree assortativity ρ =−0.077 336 1
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.522 533
Clustering coefficient c =0.207 961
Directed clustering coefficient c± =0.738 485
Spectral norm α =451.040
Operator 2-norm ν =247.467
Cyclic eigenvalue π =205.149
Algebraic connectivity a =0.051 108 3
Reciprocity y =0.372 712
Non-bipartivity bA =0.636 484
Normalized non-bipartivity bN =0.030 880 1
Spectral bipartite frustration bK =0.000 602 497


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 ]