Wikipedia links (su)

This network consists of the wikilinks of the Wikipedia in the Sundanese language (su). 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_su
NameWikipedia links (su)
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 =42,142
Volume m =1,217,970
Loop count l =64
Wedge count s =1,291,641,332
Claw count z =5,406,652,712,264
Cross count x =20,026,165,991,533,284
Triangle count t =32,089,503
Square count q =9,448,475,359
4-Tour count T4 =80,756,016,662
Maximum degree dmax =19,840
Maximum outdegree d+max =3,033
Maximum indegree dmax =19,840
Average degree d =57.803 1
Fill p =0.000 685 814
Size of LCC N =42,111
Size of LSCC Ns =20,497
Relative size of LSCC Nrs =0.486 379
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.365 46
90-Percentile effective diameter δ0.9 =3.342 56
Mean distance δm =2.856 71
Gini coefficient G =0.762 708
Relative edge distribution entropy Her =0.864 364
Power law exponent γ =1.385 75
Tail power law exponent γt =2.051 00
Degree assortativity ρ =−0.139 317
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.786 550
Clustering coefficient c =0.074 531 9
Directed clustering coefficient c± =0.802 625
Spectral norm α =750.366
Operator 2-norm ν =380.553
Cyclic eigenvalue π =369.772
Algebraic connectivity a =0.032 373 7
Reciprocity y =0.646 497
Non-bipartivity bA =0.631 121
Normalized non-bipartivity bN =0.002 190 65
Spectral bipartite frustration bK =0.000 152 507


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

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 ]