Wikipedia links (or)

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

CodeWor
Internal namewikipedia_link_or
NameWikipedia links (or)
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 =25,876
Volume m =439,724
Loop count l =1,205
Wedge count s =93,830,413
Claw count z =61,941,203,410
Cross count x =31,583,604,437,513
Triangle count t =14,096,716
Square count q =3,747,010,961
4-Tour count T4 =28,770,629,320
Maximum degree dmax =4,754
Maximum outdegree d+max =433
Maximum indegree dmax =4,595
Average degree d =33.987 0
Fill p =0.000 685 783
Size of LCC N =25,706
Size of LSCC Ns =12,151
Relative size of LSCC Nrs =0.487 698
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.709 78
90-Percentile effective diameter δ0.9 =5.523 35
Median distance δM =4
Mean distance δm =4.268 90
Gini coefficient G =0.835 987
Balanced inequality ratio P =0.146 856
Outdegree balanced inequality ratio P+ =0.152 537
Indegree balanced inequality ratio P =0.130 270
Relative edge distribution entropy Her =0.829 239
Power law exponent γ =1.646 04
Tail power law exponent γt =1.771 00
Degree assortativity ρ =−0.091 239 3
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.672 174
Clustering coefficient c =0.450 708
Directed clustering coefficient c± =0.852 149
Spectral norm α =742.353
Operator 2-norm ν =377.168
Cyclic eigenvalue π =364.881
Algebraic connectivity a =0.056 730 1
Reciprocity y =0.563 742
Non-bipartivity bA =0.817 599
Normalized non-bipartivity bN =0.066 534 9
Spectral bipartite frustration bK =0.001 093 46

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 ]