Wikipedia links (he)

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

CodeWhe
Internal namewikipedia_link_he
NameWikipedia links (he)
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 =387,503
Volume m =15,082,322
Loop count l =3,486
Wedge count s =27,580,506,266
Claw count z =201,846,622,270,886
Cross count x =2,657,588,695,186,492,928
Triangle count t =226,503,590
Maximum degree dmax =82,925
Maximum outdegree d+max =1,515
Maximum indegree d−max =82,874
Average degree d =77.843 6
Fill p =0.000 100 443
Size of LCC N =387,487
Size of LSCC Ns =267,607
Relative size of LSCC Nrs =0.690 593
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.766 17
90-Percentile effective diameter δ0.9 =3.863 81
Median distance δM =3
Mean distance δm =3.306 94
Balanced inequality ratio P =0.204 883
Outdegree balanced inequality ratio P+ =0.234 833
Indegree balanced inequality ratio P− =0.159 873
Relative edge distribution entropy Her =0.880 743
Degree assortativity ρ =−0.075 660 4
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.579 167
Clustering coefficient c =0.024 637 4
Directed clustering coefficient c± =0.162 573
Operator 2-norm ν =1,459.71
Cyclic eigenvalue π =359.967
Spectral separation |λ1[A] / λ2[A]| =1.076 92
Reciprocity y =0.218 505
Non-bipartivity bA =0.070 760 2
Normalized non-bipartivity bN =0.048 940 2
Controllability C =128,450
Relative controllability Cr =0.331 481

Plots

Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Spectral distribution of the adjacency matrix

Spectral graph drawing based on the normalized adjacency matrix

Hop distribution

Delaunay graph drawing

In/outdegree scatter plot

Clustering coefficient distribution

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 ]