Wikipedia links (xal)

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

CodeWxal
Internal namewikipedia_link_xal
NameWikipedia links (xal)
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
LoopsDoes not contain loops

Statistics

Size n =2,697
Volume m =232,680
Loop count l =0
Wedge count s =37,677,546
Claw count z =29,432,759,460
Cross count x =5,047,659,030,439
Triangle count t =12,123,606
Square count q =3,055,110,062
4-Tour count T4 =24,591,843,254
Maximum degree dmax =748
Maximum outdegree d+max =383
Maximum indegree dmax =410
Average degree d =172.547
Fill p =0.032 000 6
Size of LCC N =2,593
Size of LSCC Ns =1,168
Relative size of LSCC Nrs =0.433 074
Diameter δ =15
50-Percentile effective diameter δ0.5 =3.773 24
90-Percentile effective diameter δ0.9 =5.944 46
Median distance δM =4
Mean distance δm =4.361 31
Gini coefficient G =0.727 944
Balanced inequality ratio P =0.198 584
Outdegree balanced inequality ratio P+ =0.216 611
Indegree balanced inequality ratio P =0.256 060
Relative edge distribution entropy Her =0.864 573
Power law exponent γ =1.390 62
Tail power law exponent γt =1.321 00
Tail power law exponent with p γ3 =1.321 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =1.331 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =1.281 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =+0.843 541
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.881 944
Clustering coefficient c =0.965 318
Directed clustering coefficient c± =0.973 986
Spectral norm α =723.788
Operator 2-norm ν =365.856
Cyclic eigenvalue π =357.700
Algebraic connectivity a =0.006 338 91
Spectral separation 1[A] / λ2[A]| =1.505 74
Reciprocity y =0.914 501
Non-bipartivity bA =0.911 064
Normalized non-bipartivity bN =0.010 124 6
Algebraic non-bipartivity χ =0.019 913 2
Spectral bipartite frustration bK =5.115 28 × 10−5
Controllability C =951
Relative controllability Cr =0.352 614

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 ]