Wikipedia links (mzn)

This network consists of the wikilinks of the Wikipedia in the Mazanderani language (mzn). 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_mzn
NameWikipedia links (mzn)
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 =18,112
Volume m =1,476,267
Loop count l =48
Wedge count s =441,683,902
Claw count z =365,810,682,336
Cross count x =109,569,824,493,924
Triangle count t =108,101,804
Square count q =40,763,960,591
4-Tour count T4 =326,838,544,648
Maximum degree dmax =4,349
Maximum outdegree d+max =1,010
Maximum indegree dmax =3,778
Average degree d =163.015
Fill p =0.004 568 27
Size of LCC N =18,020
Size of LSCC Ns =9,139
Relative size of LSCC Nrs =0.508 853
Diameter δ =11
50-Percentile effective diameter δ0.5 =2.936 50
90-Percentile effective diameter δ0.9 =4.060 58
Median distance δM =3
Mean distance δm =3.472 28
Gini coefficient G =0.780 326
Balanced inequality ratio P =0.172 589
Outdegree balanced inequality ratio P+ =0.187 583
Indegree balanced inequality ratio P =0.192 452
Relative edge distribution entropy Her =0.874 743
Power law exponent γ =1.362 69
Tail power law exponent γt =1.571 00
Degree assortativity ρ =+0.015 714 0
Degree assortativity p-value pρ =3.198 03 × 10−101
In/outdegree correlation ρ± =+0.762 652
Clustering coefficient c =0.734 248
Directed clustering coefficient c± =0.975 843
Spectral norm α =1,037.32
Operator 2-norm ν =532.820
Cyclic eigenvalue π =517.995
Algebraic connectivity a =0.105 013
Reciprocity y =0.746 294
Non-bipartivity bA =0.814 375
Normalized non-bipartivity bN =0.058 034 0
Spectral bipartite frustration bK =0.000 239 229


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 ]