Wikipedia links (pms)

This network consists of the wikilinks of the Wikipedia in the Piedmontese language (pms). 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_pms
NameWikipedia links (pms)
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 =67,205
Volume m =569,036
Loop count l =3
Wedge count s =5,227,582,024
Claw count z =71,827,411,630,676
Cross count x =871,232,667,869,401,600
Triangle count t =1,129,980
Square count q =12,322,196,055
4-Tour count T4 =118,940,702,510
Maximum degree dmax =62,772
Maximum outdegree d+max =1,487
Maximum indegree dmax =62,701
Average degree d =16.934 3
Fill p =0.000 124 721
Size of LCC N =67,205
Size of LSCC Ns =19,577
Relative size of LSCC Nrs =0.291 972
Diameter δ =6
50-Percentile effective diameter δ0.5 =1.571 09
90-Percentile effective diameter δ0.9 =2.204 42
Median distance δM =2
Mean distance δm =2.128 47
Gini coefficient G =0.619 964
Balanced inequality ratio P =0.286 669
Outdegree balanced inequality ratio P+ =0.387 014
Indegree balanced inequality ratio P =0.107 958
Relative edge distribution entropy Her =0.785 930
Power law exponent γ =1.505 47
Tail power law exponent γt =1.871 00
Degree assortativity ρ =−0.316 769
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.134 883
Clustering coefficient c =0.000 648 472
Directed clustering coefficient c± =0.099 485 2
Spectral norm α =493.106
Operator 2-norm ν =490.423
Cyclic eigenvalue π =50.000 0
Algebraic connectivity a =0.212 717
Reciprocity y =0.128 050
Non-bipartivity bA =0.010 455 2
Normalized non-bipartivity bN =0.043 992 6
Spectral bipartite frustration bK =0.003 755 07


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 ]