Wikipedia links (pnb)

This network consists of the wikilinks of the Wikipedia in the Western Punjabi language (pnb). 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_pnb
NameWikipedia links (pnb)
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 =51,933
Volume m =1,436,320
Loop count l =14
Wedge count s =755,607,228
Claw count z =2,184,922,413,634
Cross count x =6,947,913,867,227,964
Triangle count t =34,753,879
Square count q =8,317,395,621
4-Tour count T4 =69,423,952,216
Maximum degree dmax =16,696
Maximum outdegree d+max =1,338
Maximum indegree dmax =16,688
Average degree d =55.314 3
Fill p =0.000 566 189
Size of LCC N =51,897
Size of LSCC Ns =31,073
Relative size of LSCC Nrs =0.620 294
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.910 35
90-Percentile effective diameter δ0.9 =3.909 59
Median distance δM =3
Mean distance δm =3.376 74
Gini coefficient G =0.745 033
Balanced inequality ratio P =0.194 055
Outdegree balanced inequality ratio P+ =0.219 541
Indegree balanced inequality ratio P =0.178 613
Relative edge distribution entropy Her =0.885 884
Power law exponent γ =1.384 16
Tail power law exponent γt =1.711 00
Degree assortativity ρ =−0.081 953 9
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.618 121
Clustering coefficient c =0.137 984
Directed clustering coefficient c± =0.832 105
Spectral norm α =733.189
Operator 2-norm ν =375.727
Cyclic eigenvalue π =356.862
Algebraic connectivity a =0.038 084 1
Reciprocity y =0.593 754
Non-bipartivity bA =0.688 786
Normalized non-bipartivity bN =0.057 390 7
Spectral bipartite frustration bK =0.000 694 119


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 ]