Wikipedia links (new)

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

CodeWnew
Internal namewikipedia_link_new
NameWikipedia links (new)
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 =100,573
Volume m =1,808,560
Loop count l =12
Wedge count s =3,525,364,680
Claw count z =16,033,756,221,400
Cross count x =77,692,330,386,667,984
Triangle count t =35,735,988
Square count q =35,259,701,788
4-Tour count T4 =296,182,164,066
Maximum degree dmax =31,834
Maximum outdegree d+max =3,764
Maximum indegree dmax =31,736
Average degree d =35.965 1
Size of LCC N =100,314
Size of LSCC Ns =40,928
Relative size of LSCC Nrs =0.406 948
Diameter δ =14
50-Percentile effective diameter δ0.5 =2.944 58
90-Percentile effective diameter δ0.9 =4.481 22
Median distance δM =3
Mean distance δm =3.536 62
Gini coefficient G =0.816 897
Balanced inequality ratio P =0.179 338
Outdegree balanced inequality ratio P+ =0.235 076
Indegree balanced inequality ratio P =0.077 757 4
Relative edge distribution entropy Her =0.822 321
Power law exponent γ =1.522 40
Tail power law exponent γt =2.091 00
Degree assortativity ρ =−0.197 731
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.388 098
Clustering coefficient c =0.030 410 5
Directed clustering coefficient c± =0.703 533
Spectral norm α =751.404
Operator 2-norm ν =513.736
Algebraic connectivity a =0.017 561 2
Spectral separation 1[A] / λ2[A]| =1.119 42
Non-bipartivity bA =0.333 550
Normalized non-bipartivity bN =0.003 264 67
Spectral bipartite frustration bK =0.000 373 981
Controllability C =71,003
Relative controllability Cr =0.705 985

Plots

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

Delaunay graph drawing

In/outdegree scatter plot

Clustering coefficient distribution

Average neighbor degree distribution

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 ]