Wikipedia links (ja)

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


Internal namewikipedia_link_ja
NameWikipedia links (ja)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops


Size n =1,767,268
Volume m =83,202,622
Loop count l =7,419
Wedge count s =231,061,522,723
Claw count z =6,284,858,079,305,112
Cross count x =2.879 6 × 1020
Triangle count t =1,681,965,915
Square count q =488,448,691,023
4-Tour count T4 =4,502,336,616,982
Maximum degree dmax =276,101
Maximum outdegree d+max =6,505
Maximum indegree dmax =273,502
Average degree d =94.159 6
Fill p =2.739 07 × 10−5
Size of LCC N =1,767,214
Size of LSCC Ns =1,242,374
Relative size of LSCC Nrs =0.771 355
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.890 05
90-Percentile effective diameter δ0.9 =3.920 03
Median distance δM =3
Mean distance δm =3.446 29
Gini coefficient G =0.756 830
Balanced inequality ratio P =0.200 398
Outdegree balanced inequality ratio P+ =0.222 299
Indegree balanced inequality ratio P =0.181 332
Relative edge distribution entropy Her =0.901 014
Power law exponent γ =1.370 21
Tail power law exponent γt =2.091 00
Degree assortativity ρ =−0.040 410 2
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.021 837 9
Directed clustering coefficient c± =0.207 987
Spectral norm α =1,708.41
Operator 2-norm ν =1,012.12
Cyclic eigenvalue π =869.026
Reciprocity y =0.421 589
Non-bipartivity bA =0.553 512
Normalized non-bipartivity bN =0.050 930 5


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 normalized adjacency matrix

Hop distribution

In/outdegree scatter plot

Edge weight/multiplicity distribution

Matrix decompositions plots



[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]