Wikipedia links (jv)

This network consists of the wikilinks of the Wikipedia in the Javanese language (jv). 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_jv
NameWikipedia links (jv)
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 =66,065
Volume m =1,814,634
Loop count l =197
Wedge count s =2,333,994,572
Claw count z =9,269,604,725,234
Cross count x =39,120,154,631,111,032
Triangle count t =28,747,310
Square count q =26,499,446,987
4-Tour count T4 =221,334,701,674
Maximum degree dmax =23,861
Maximum outdegree d+max =2,022
Maximum indegree dmax =23,414
Average degree d =54.934 8
Fill p =0.000 415 763
Size of LCC N =65,992
Size of LSCC Ns =46,461
Relative size of LSCC Nrs =0.703 262
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.678 87
90-Percentile effective diameter δ0.9 =3.857 32
Mean distance δm =3.229 96
Gini coefficient G =0.675 105
Relative edge distribution entropy Her =0.893 109
Power law exponent γ =1.363 29
Tail power law exponent γt =2.851 00
Degree assortativity ρ =−0.127 260
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.509 769
Clustering coefficient c =0.036 950 4
Directed clustering coefficient c± =0.478 640
Spectral norm α =578.375
Operator 2-norm ν =522.977
Cyclic eigenvalue π =106.477
Reciprocity y =0.265 387
Non-bipartivity bA =0.188 484
Normalized non-bipartivity bN =0.023 353 8
Spectral bipartite frustration bK =0.000 749 412
Controllability C =21,217
Relative controllability Cr =0.321 153


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

Degree assortativity

Zipf plot

Hop distribution

Delaunay graph drawing

In/outdegree scatter plot

Clustering coefficient distribution

Average neighbor degree 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 ]