Wikipedia links (mr)

This network consists of the wikilinks of the Wikipedia in the Marathi language (mr). 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_mr
NameWikipedia links (mr)
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 =93,638
Volume m =1,886,320
Wedge count s =380,809,824
Claw count z =304,535,355,116
Cross count x =391,982,426,848,806
Triangle count t =51,981,969
Square count q =10,588,813,995
4-Tour count T4 =82,470,635,624
Maximum degree dmax =9,431
Maximum outdegree d+max =1,110
Maximum indegree dmax =9,031
Average degree d =40.289 6
Size of LCC N =92,875
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.448 60
90-Percentile effective diameter δ0.9 =4.662 12
Median distance δM =4
Mean distance δm =3.957 24
Gini coefficient G =0.817 332
Balanced inequality ratio P =0.162 896
Outdegree balanced inequality ratio P+ =0.160 949
Indegree balanced inequality ratio P =0.165 651
Power law exponent γ =1.545 87
Tail power law exponent γt =1.771 00
Tail power law exponent with p γ3 =1.771 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =1.811 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =1.521 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.035 082 7
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.717 655
Clustering coefficient c =0.409 511
Directed clustering coefficient c± =0.732 616
Operator 2-norm ν =383.022
Cyclic eigenvalue π =363.602
Reciprocity y =0.518 206
Non-bipartivity bA =0.851 083
Normalized non-bipartivity bN =0.042 925 8
Spectral bipartite frustration bK =0.000 720 598


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 normalized adjacency matrix

Degree assortativity

Zipf plot

Hop distribution

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 ]