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,688
Volume m =184,790
Loop count l =46
Wedge count s =32,832,880
Claw count z =7,821,538,712
Cross count x =1,919,010,895,885
Triangle count t =5,381,706
Square count q =1,099,960,266
4-Tour count T4 =8,931,333,722
Maximum degree dmax =1,902
Maximum outdegree d+max =486
Maximum indegree dmax =1,746
Average degree d =23.558 1
Fill p =0.000 750 833
Size of LCC N =15,658
Size of LSCC Ns =4,815
Relative size of LSCC Nrs =0.306 922
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.424 24
90-Percentile effective diameter δ0.9 =4.629 00
Median distance δM =4
Mean distance δm =3.903 68
Gini coefficient G =0.854 044
Relative edge distribution entropy Her =0.817 758
Power law exponent γ =1.900 16
Tail power law exponent γt =1.701 00
Degree assortativity ρ =+0.011 233 5
Degree assortativity p-value pρ =2.076 88 × 10−10
In/outdegree correlation ρ± =+0.619 256
Clustering coefficient c =0.491 736
Directed clustering coefficient c± =0.727 641
Spectral norm α =339.761
Operator 2-norm ν =217.246
Cyclic eigenvalue π =122.301
Algebraic connectivity a =0.013 553 4
Reciprocity y =0.267 655
Non-bipartivity bA =0.610 185
Normalized non-bipartivity bN =0.006 861 04
Spectral bipartite frustration bK =0.000 164 992


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

Double Laplacian graph drawing

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 ]