Wikipedia links (pam)

This network consists of the wikilinks of the Wikipedia in the Pampanga language (pam). 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_pam
NameWikipedia links (pam)
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 =9,520
Volume m =219,835
Loop count l =147
Wedge count s =25,440,207
Claw count z =9,715,464,724
Cross count x =3,479,614,689,794
Triangle count t =2,504,926
Square count q =216,137,751
4-Tour count T4 =1,831,162,120
Maximum degree dmax =2,306
Maximum outdegree d+max =1,698
Maximum indegree dmax =2,176
Average degree d =46.183 8
Fill p =0.002 425 62
Size of LCC N =9,489
Size of LSCC Ns =6,310
Relative size of LSCC Nrs =0.662 815
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.760 99
90-Percentile effective diameter δ0.9 =3.860 81
Median distance δM =3
Mean distance δm =3.310 19
Gini coefficient G =0.649 883
Relative edge distribution entropy Her =0.911 668
Power law exponent γ =1.387 25
Tail power law exponent γt =2.721 00
Degree assortativity ρ =−0.115 099
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.704 281
Clustering coefficient c =0.295 390
Directed clustering coefficient c± =0.778 133
Spectral norm α =310.576
Operator 2-norm ν =158.574
Cyclic eigenvalue π =152.021
Algebraic connectivity a =0.059 003 7
Reciprocity y =0.637 928
Non-bipartivity bA =0.734 886
Normalized non-bipartivity bN =0.032 870 9
Spectral bipartite frustration bK =0.000 471 306


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 ]