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.

Metadata

CodeWpa
Internal namewikipedia_link_pa
NameWikipedia links (pa)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =39,753
Volume m =537,334
Loop count l =98
Wedge count s =158,126,133
Claw count z =188,089,301,058
Cross count x =277,516,292,358,026
Triangle count t =10,189,866
Square count q =1,788,144,105
4-Tour count T4 =14,938,535,770
Maximum degree dmax =8,309
Maximum outdegree d+max =611
Maximum indegree dmax =8,072
Average degree d =27.033 6
Fill p =0.000 340 020
Size of LCC N =39,141
Size of LSCC Ns =18,351
Relative size of LSCC Nrs =0.461 626
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.468 77
90-Percentile effective diameter δ0.9 =4.870 35
Median distance δM =4
Mean distance δm =4.006 13
Gini coefficient G =0.797 336
Balanced inequality ratio P =0.165 887
Outdegree balanced inequality ratio P+ =0.189 461
Indegree balanced inequality ratio P =0.159 662
Relative edge distribution entropy Her =0.858 863
Power law exponent γ =1.574 10
Tail power law exponent γt =1.801 00
Tail power law exponent with p γ3 =1.801 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =1.551 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =1.511 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.079 455 3
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.515 077
Clustering coefficient c =0.193 324
Directed clustering coefficient c± =0.731 484
Spectral norm α =450.575
Operator 2-norm ν =247.306
Cyclic eigenvalue π =205.149
Algebraic connectivity a =0.036 865 0
Spectral separation 1[A] / λ2[A]| =1.474 81
Reciprocity y =0.365 084
Non-bipartivity bA =0.613 617
Normalized non-bipartivity bN =0.020 379 9
Algebraic non-bipartivity χ =0.036 855 4
Spectral bipartite frustration bK =0.000 410 797
Controllability C =19,670
Relative controllability Cr =0.494 805

Plots

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

SynGraphy

Matrix decompositions plots

Downloads

References

[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]