Wikipedia links (dv)

This network consists of the wikilinks of the Wikipedia in the Divehi language (dv). 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_dv
NameWikipedia links (dv)
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 =4,256
Volume m =206,604
Loop count l =0
Wedge count s =35,404,922
Claw count z =29,655,704,689
Cross count x =5,370,668,937,351
Triangle count t =11,117,649
Square count q =2,895,700,707
4-Tour count T4 =23,307,455,686
Maximum degree dmax =1,104
Maximum outdegree d+max =1,092
Maximum indegree dmax =1,102
Average degree d =97.088 3
Fill p =0.011 408 7
Size of LCC N =4,117
Size of LSCC Ns =1,399
Relative size of LSCC Nrs =0.328 712
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.451 32
90-Percentile effective diameter δ0.9 =5.124 54
Median distance δM =4
Mean distance δm =4.000 08
Gini coefficient G =0.839 839
Relative edge distribution entropy Her =0.805 533
Power law exponent γ =1.511 43
Tail power law exponent γt =1.501 00
Degree assortativity ρ =+0.391 421
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.832 956
Clustering coefficient c =0.942 043
Directed clustering coefficient c± =0.993 650
Spectral norm α =748.850
Operator 2-norm ν =375.702
Cyclic eigenvalue π =373.145
Algebraic connectivity a =0.014 562 5
Reciprocity y =0.885 104
Non-bipartivity bA =0.942 372
Normalized non-bipartivity bN =0.020 031 2
Spectral bipartite frustration bK =0.000 224 540


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 ]