Wikipedia links (hif)

This network consists of the wikilinks of the Wikipedia in the Fiji Hindi language (hif). 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_hif
NameWikipedia links (hif)
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 =8,712
Volume m =334,713
Loop count l =0
Wedge count s =60,284,943
Claw count z =47,015,412,249
Cross count x =15,784,463,640,639
Triangle count t =13,801,159
Square count q =3,252,209,079
4-Tour count T4 =26,259,208,710
Maximum degree dmax =3,762
Maximum outdegree d+max =695
Maximum indegree dmax =3,669
Average degree d =76.839 5
Fill p =0.004 410 49
Size of LCC N =8,700
Size of LSCC Ns =3,619
Relative size of LSCC Nrs =0.415 404
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.636 29
90-Percentile effective diameter δ0.9 =3.826 31
Median distance δM =3
Mean distance δm =3.149 22
Gini coefficient G =0.834 474
Relative edge distribution entropy Her =0.828 676
Power law exponent γ =1.471 72
Tail power law exponent γt =1.471 00
Degree assortativity ρ =−0.103 169
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.825 451
Clustering coefficient c =0.686 796
Directed clustering coefficient c± =0.936 274
Spectral norm α =753.670
Operator 2-norm ν =377.478
Cyclic eigenvalue π =376.193
Algebraic connectivity a =0.155 877
Reciprocity y =0.815 983
Non-bipartivity bA =0.889 883
Normalized non-bipartivity bN =0.028 095 8
Spectral bipartite frustration bK =0.000 748 756


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 ]