Wikipedia links (si)

This network consists of the wikilinks of the Wikipedia in the Sinhala language (si). 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_si
NameWikipedia links (si)
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 =23,225
Volume m =184,381
Loop count l =70
Wedge count s =24,080,945
Claw count z =9,858,289,380
Cross count x =5,015,318,429,605
Triangle count t =1,666,893
Square count q =262,066,242
4-Tour count T4 =2,193,168,198
Maximum degree dmax =2,952
Maximum outdegree d+max =1,188
Maximum indegree dmax =2,756
Average degree d =15.877 8
Fill p =0.000 341 826
Size of LCC N =21,411
Size of LSCC Ns =9,876
Relative size of LSCC Nrs =0.425 231
Diameter δ =18
50-Percentile effective diameter δ0.5 =3.908 68
90-Percentile effective diameter δ0.9 =5.449 68
Median distance δM =4
Mean distance δm =4.451 38
Gini coefficient G =0.760 890
Relative edge distribution entropy Her =0.868 299
Power law exponent γ =1.704 16
Tail power law exponent γt =2.011 00
Degree assortativity ρ =−0.089 417 2
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.532 084
Clustering coefficient c =0.207 661
Directed clustering coefficient c± =0.515 119
Spectral norm α =227.363
Operator 2-norm ν =163.339
Cyclic eigenvalue π =61.006 5
Algebraic connectivity a =0.010 799 5
Reciprocity y =0.294 011
Non-bipartivity bA =0.540 196
Normalized non-bipartivity bN =0.005 562 69
Spectral bipartite frustration bK =0.000 184 250


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 ]