Wikipedia links (xmf)

This network consists of the wikilinks of the Wikipedia in the Mingrelian language (xmf). 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_xmf
NameWikipedia links (xmf)
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,397
Volume m =402,052
Loop count l =29
Wedge count s =114,799,554
Claw count z =75,086,802,177
Cross count x =45,253,728,502,563
Triangle count t =7,417,112
Square count q =2,075,924,390
4-Tour count T4 =17,067,209,574
Maximum degree dmax =4,499
Maximum outdegree d+max =369
Maximum indegree dmax =4,496
Average degree d =52.224 7
Fill p =0.001 695 94
Size of LCC N =15,384
Size of LSCC Ns =10,570
Relative size of LSCC Nrs =0.686 497
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.612 58
90-Percentile effective diameter δ0.9 =3.713 04
Median distance δM =3
Mean distance δm =3.149 38
Gini coefficient G =0.712 668
Relative edge distribution entropy Her =0.885 303
Power law exponent γ =1.390 88
Tail power law exponent γt =2.321 00
Degree assortativity ρ =−0.183 138
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.693 572
Clustering coefficient c =0.193 828
Directed clustering coefficient c± =0.804 571
Spectral norm α =553.049
Operator 2-norm ν =291.023
Cyclic eigenvalue π =262.021
Algebraic connectivity a =0.147 092
Reciprocity y =0.467 196
Non-bipartivity bA =0.590 072
Normalized non-bipartivity bN =0.053 509 8
Spectral bipartite frustration bK =0.000 556 694


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 ]