Wikipedia links (pt)

This network consists of the wikilinks of the Wikipedia in the Portuguese language (pt). 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_pt
NameWikipedia links (pt)
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 =1,744,781
Volume m =57,679,728
Loop count l =10,862
Wedge count s =197,387,941,590
Claw count z =5,820,294,597,676,625
Cross count x =2.047 63 × 1020
Triangle count t =1,530,810,870
Square count q =681,168,760,896
4-Tour count T4 =6,033,394,188,086
Maximum degree dmax =225,073
Maximum outdegree d+max =5,691
Maximum indegree dmax =224,562
Average degree d =66.116 9
Fill p =1.894 70 × 10−5
Size of LCC N =1,744,528
Size of LSCC Ns =1,202,091
Relative size of LSCC Nrs =0.688 964
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.075 67
90-Percentile effective diameter δ0.9 =4.021 44
Median distance δM =4
Mean distance δm =3.582 54
Gini coefficient G =0.796 257
Balanced inequality ratio P =0.184 080
Outdegree balanced inequality ratio P+ =0.200 363
Indegree balanced inequality ratio P =0.169 299
Relative edge distribution entropy Her =0.889 544
Power law exponent γ =1.422 57
Tail power law exponent γt =1.851 00
Degree assortativity ρ =−0.049 579 8
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.688 687
Clustering coefficient c =0.023 266 0
Directed clustering coefficient c± =0.431 589
Spectral norm α =2,087.03
Operator 2-norm ν =1,047.20
Cyclic eigenvalue π =1,040.00
Reciprocity y =0.436 425
Non-bipartivity bA =0.561 257
Normalized non-bipartivity bN =0.039 453 6


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 normalized adjacency matrix

Hop distribution

In/outdegree scatter plot

Edge weight/multiplicity distribution

Clustering coefficient 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 ]