Wikipedia links (ml)

This network consists of the wikilinks of the Wikipedia in the Malayalam language (ml). 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.

Metadata

CodeWml
Internal namewikipedia_link_ml
NameWikipedia links (ml)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =127,528
Volume m =2,028,111
Loop count l =266
Wedge count s =499,768,411
Claw count z =433,678,931,722
Cross count x =616,982,289,944,458
Triangle count t =50,272,958
Square count q =17,844,802,082
4-Tour count T4 =144,760,801,562
Maximum degree dmax =9,883
Maximum outdegree d+max =1,466
Maximum indegree dmax =9,482
Average degree d =31.806 5
Fill p =0.000 124 704
Size of LCC N =126,076
Size of LSCC Ns =85,806
Relative size of LSCC Nrs =0.672 840
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.549 71
90-Percentile effective diameter δ0.9 =4.930 43
Mean distance δm =4.109 06
Gini coefficient G =0.811 872
Relative edge distribution entropy Her =0.868 392
Power law exponent γ =1.598 21
Tail power law exponent γt =1.731 00
Degree assortativity ρ =−0.026 524 6
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.513 040
Clustering coefficient c =0.301 778
Directed clustering coefficient c± =0.723 233
Spectral norm α =764.796
Operator 2-norm ν =434.894
Cyclic eigenvalue π =380.237
Reciprocity y =0.367 186
Non-bipartivity bA =0.568 782
Normalized non-bipartivity bN =0.042 367 0
Spectral bipartite frustration bK =0.000 948 833
Controllability C =40,991
Relative controllability Cr =0.321 427

Plots

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

SynGraphy

Matrix decompositions plots

Downloads

References

[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]