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,600
Volume m =405,676
Loop count l =29
Wedge count s =115,457,818
Claw count z =75,664,303,619
Cross count x =45,957,394,482,805
Triangle count t =7,435,099
Square count q =2,076,621,957
4-Tour count T4 =17,075,429,354
Maximum degree dmax =4,542
Maximum outdegree d+max =370
Maximum indegree dmax =4,539
Average degree d =52.009 7
Fill p =0.001 666 98
Size of LCC N =15,587
Size of LSCC Ns =10,784
Relative size of LSCC Nrs =0.691 282
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.637 19
90-Percentile effective diameter δ0.9 =3.729 49
Median distance δM =3
Mean distance δm =3.177 10
Gini coefficient G =0.712 438
Balanced inequality ratio P =0.230 876
Outdegree balanced inequality ratio P+ =0.261 546
Indegree balanced inequality ratio P =0.190 652
Relative edge distribution entropy Her =0.885 575
Power law exponent γ =1.390 69
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 190
Directed clustering coefficient c± =0.802 356
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 511 8
Spectral bipartite frustration bK =0.000 558 449


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 ]