Wikipedia links (os)

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

CodeWos
Internal namewikipedia_link_os
NameWikipedia links (os)
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 =20,874
Volume m =265,981
Loop count l =11
Wedge count s =31,757,770
Claw count z =14,659,166,244
Cross count x =5,663,825,637,156
Triangle count t =3,350,064
Square count q =355,276,203
4-Tour count T4 =2,969,600,698
Maximum degree dmax =2,622
Maximum outdegree d+max =357
Maximum indegree dmax =2,609
Average degree d =25.484 4
Fill p =0.000 610 435
Size of LCC N =20,824
Size of LSCC Ns =10,459
Relative size of LSCC Nrs =0.501 054
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.400 70
90-Percentile effective diameter δ0.9 =4.826 51
Median distance δM =4
Mean distance δm =3.920 65
Gini coefficient G =0.795 967
Balanced inequality ratio P =0.177 484
Outdegree balanced inequality ratio P+ =0.191 126
Indegree balanced inequality ratio P =0.190 675
Relative edge distribution entropy Her =0.855 984
Power law exponent γ =1.650 93
Tail power law exponent γt =1.951 00
Tail power law exponent with p γ3 =1.951 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =1.871 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =1.851 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.087 151 1
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.800 361
Clustering coefficient c =0.316 464
Directed clustering coefficient c± =0.786 309
Spectral norm α =358.763
Operator 2-norm ν =181.792
Cyclic eigenvalue π =177.134
Algebraic connectivity a =0.141 053
Spectral separation 1[A] / λ2[A]| =1.051 10
Reciprocity y =0.646 501
Non-bipartivity bA =0.824 048
Normalized non-bipartivity bN =0.105 750
Algebraic non-bipartivity χ =0.196 428
Spectral bipartite frustration bK =0.002 840 92
Controllability C =9,908
Relative controllability Cr =0.474 657

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 ]