Wikipedia links (lo)

This network consists of the wikilinks of the Wikipedia in the Lao language (lo). 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_lo
NameWikipedia links (lo)
Data source
AvailabilityDataset is available for download
Consistency checkDataset failed tests: *** No loop found although #loop is set
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 =3,702
Volume m =131,650
Loop count l =0
Wedge count s =26,304,393
Claw count z =16,977,964,373
Cross count x =2,860,469,818,830
Triangle count t =8,287,799
Square count q =2,268,169,850
4-Tour count T4 =18,250,740,296
Maximum degree dmax =691
Maximum outdegree d+max =378
Maximum indegree dmax =483
Average degree d =71.123 7
Fill p =0.009 608 72
Size of LCC N =3,624
Size of LSCC Ns =1,572
Relative size of LSCC Nrs =0.424 635
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.319 73
90-Percentile effective diameter δ0.9 =4.703 59
Median distance δM =4
Mean distance δm =3.816 75
Gini coefficient G =0.864 779
Relative edge distribution entropy Her =0.776 321
Power law exponent γ =1.606 77
Tail power law exponent γt =1.461 00
Degree assortativity ρ =+0.844 214
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.765 248
Clustering coefficient c =0.945 218
Directed clustering coefficient c± =0.987 696
Spectral norm α =648.017
Operator 2-norm ν =340.512
Cyclic eigenvalue π =307.000
Algebraic connectivity a =0.087 157 0
Reciprocity y =0.754 850
Non-bipartivity bA =0.954 828
Normalized non-bipartivity bN =0.042 131 7
Spectral bipartite frustration bK =0.000 461 614


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 ]