Wikipedia links (glk)

This network consists of the wikilinks of the Wikipedia in the Gilaki language (glk). 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

CodeWglk
Internal namewikipedia_link_glk
NameWikipedia links (glk)
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 =7,332
Volume m =340,451
Loop count l =1
Wedge count s =154,613,311
Claw count z =107,872,748,531
Cross count x =67,541,537,003,605
Triangle count t =7,037,766
Square count q =2,970,947,985
4-Tour count T4 =24,386,570,162
Maximum degree dmax =4,729
Maximum outdegree d+max =772
Maximum indegree dmax =4,729
Average degree d =92.867 2
Fill p =0.006 333 00
Size of LCC N =7,261
Size of LSCC Ns =5,910
Relative size of LSCC Nrs =0.806 056
Diameter δ =11
50-Percentile effective diameter δ0.5 =1.979 38
90-Percentile effective diameter δ0.9 =3.552 13
Median distance δM =2
Mean distance δm =2.703 39
Gini coefficient G =0.578 422
Balanced inequality ratio P =0.301 415
Outdegree balanced inequality ratio P+ =0.327 339
Indegree balanced inequality ratio P =0.252 721
Relative edge distribution entropy Her =0.910 148
Power law exponent γ =1.300 52
Tail power law exponent γt =2.221 00
Tail power law exponent with p γ3 =2.221 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =2.511 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.751 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.304 972
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.569 520
Clustering coefficient c =0.136 556
Directed clustering coefficient c± =0.702 883
Spectral norm α =374.374
Algebraic connectivity a =0.062 812 7
Reciprocity y =0.434 315
Normalized non-bipartivity bN =0.019 199 8
Spectral bipartite frustration bK =0.000 213 915
Controllability C =1,492
Relative controllability Cr =0.203 492

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 ]