Wikipedia links (te)

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

CodeWte
Internal namewikipedia_link_te
NameWikipedia links (te)
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 =93,596
Volume m =2,930,023
Loop count l =153
Wedge count s =2,537,257,788
Triangle count t =64,748,752
Square count q =17,149,187,379
4-Tour count T4 =147,346,723,524
Maximum degree dmax =29,171
Maximum outdegree d+max =3,648
Maximum indegree d−max =29,103
Average degree d =62.610 0
Fill p =0.000 334 469
Size of LCC N =93,495
Size of LSCC Ns =78,386
Relative size of LSCC Nrs =0.837 493
Diameter δ =11
50-Percentile effective diameter δ0.5 =2.856 05
90-Percentile effective diameter δ0.9 =3.899 34
Median distance δM =3
Mean distance δm =3.372 66
Gini coefficient G =0.699 516
Balanced inequality ratio P =0.235 697
Outdegree balanced inequality ratio P+ =0.241 126
Indegree balanced inequality ratio P− =0.220 580
Tail power law exponent γt =2.241 00
Degree assortativity ρ =−0.052 079 5
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.076 557 6
Spectral norm α =759.303
Operator 2-norm ν =392.732
Spectral separation |λ1[A] / λ2[A]| =1.321 12
Reciprocity y =0.568 785
Non-bipartivity bA =0.555 779
Normalized non-bipartivity bN =0.048 363 0
Algebraic non-bipartivity χ =0.082 768 0
Spectral bipartite frustration bK =0.000 461 329
Controllability C =24,287
Relative controllability Cr =0.259 488

Plots

Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Lorenz curve

Degree assortativity

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 ]