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.

Metadata

CodeWpam
Internal namewikipedia_link_pam
NameWikipedia links (pam)
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 =9,537
Volume m =220,180
Loop count l =146
Wedge count s =25,507,358
Claw count z =9,718,388,349
Cross count x =3,479,735,192,309
Triangle count t =2,515,606
Square count q =216,711,576
4-Tour count T4 =1,836,022,634
Maximum degree dmax =2,306
Maximum outdegree d+max =1,698
Maximum indegree dmax =2,176
Average degree d =46.173 8
Fill p =0.002 420 77
Size of LCC N =9,504
Size of LSCC Ns =6,322
Relative size of LSCC Nrs =0.662 892
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.753 68
90-Percentile effective diameter δ0.9 =3.893 59
Median distance δM =3
Mean distance δm =3.326 81
Gini coefficient G =0.649 665
Balanced inequality ratio P =0.259 211
Outdegree balanced inequality ratio P+ =0.267 468
Indegree balanced inequality ratio P =0.251 835
Relative edge distribution entropy Her =0.911 750
Power law exponent γ =1.386 88
Tail power law exponent γt =2.711 00
Tail power law exponent with p γ3 =2.711 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =3.141 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.601 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.114 689
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.699 099
Clustering coefficient c =0.295 868
Directed clustering coefficient c± =0.777 357
Reciprocity y =0.634 118
Non-bipartivity bA =0.734 804
Normalized non-bipartivity bN =0.032 885 3
Spectral bipartite frustration bK =0.000 470 164
Controllability C =3,295
Relative controllability Cr =0.345 496

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 ]