Wikipedia links (as)

This network consists of the wikilinks of the Wikipedia in the Assamese language (as). 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_as
NameWikipedia links (as)
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 =15,989
Volume m =200,929
Loop count l =48
Wedge count s =30,877,359
Claw count z =9,869,394,434
Cross count x =2,313,219,634,089
Triangle count t =5,746,195
Square count q =1,033,609,856
4-Tour count T4 =8,392,699,714
Maximum degree dmax =2,001
Maximum outdegree d+max =501
Maximum indegree dmax =1,804
Average degree d =25.133 4
Fill p =0.000 785 959
Size of LCC N =15,965
Size of LSCC Ns =5,060
Relative size of LSCC Nrs =0.316 468
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.421 58
90-Percentile effective diameter δ0.9 =4.616 09
Median distance δM =4
Mean distance δm =3.896 72
Gini coefficient G =0.862 568
Balanced inequality ratio P =0.128 160
Outdegree balanced inequality ratio P+ =0.130 802
Indegree balanced inequality ratio P =0.177 122
Relative edge distribution entropy Her =0.811 181
Power law exponent γ =1.908 64
Degree assortativity ρ =+0.010 700 3
Degree assortativity p-value pρ =2.350 10 × 10−9
In/outdegree correlation ρ± =+0.721 343
Clustering coefficient c =0.558 292
Directed clustering coefficient c± =0.803 376
Spectral norm α =417.224
Operator 2-norm ν =219.090
Cyclic eigenvalue π =198.103
Spectral separation 1[A] / λ2[A]| =1.235 35
Reciprocity y =0.449 811
Non-bipartivity bA =0.769 644
Algebraic non-bipartivity χ =0.013 493 7
Controllability C =10,837
Relative controllability Cr =0.677 778


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 ]