Wikipedia links (crh)

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

CodeWcrh
Internal namewikipedia_link_crh
NameWikipedia links (crh)
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 =8,286
Volume m =175,470
Loop count l =4
Wedge count s =22,499,828
Claw count z =11,789,187,370
Cross count x =5,563,557,998,673
Triangle count t =2,479,408
Square count q =209,079,883
4-Tour count T4 =1,762,846,836
Maximum degree dmax =2,680
Maximum outdegree d+max =454
Maximum indegree dmax =2,543
Average degree d =42.353 4
Fill p =0.002 555 72
Size of LCC N =5,590
Size of LSCC Ns =3,527
Relative size of LSCC Nrs =0.425 658
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.514 50
90-Percentile effective diameter δ0.9 =3.948 76
Median distance δM =3
Mean distance δm =3.109 91
Gini coefficient G =0.770 721
Balanced inequality ratio P =0.180 048
Outdegree balanced inequality ratio P+ =0.233 322
Indegree balanced inequality ratio P =0.228 757
Relative edge distribution entropy Her =0.862 861
Power law exponent γ =1.622 32
Tail power law exponent γt =1.471 00
Tail power law exponent with p γ3 =2.891 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =2.991 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =3.211 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.093 602 5
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.857 058
Clustering coefficient c =0.330 590
Directed clustering coefficient c± =0.844 104
Spectral norm α =260.526
Operator 2-norm ν =139.272
Cyclic eigenvalue π =130.013
Algebraic connectivity a =0.076 704 1
Reciprocity y =0.811 968
Normalized non-bipartivity bN =0.041 942 4
Spectral bipartite frustration bK =0.000 518 521
Controllability C =3,343
Relative controllability Cr =0.403 452

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 ]