Wikipedia links (ur)

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

CodeWur
Internal namewikipedia_link_ur
NameWikipedia links (ur)
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 =332,057
Volume m =8,079,171
Loop count l =200
Wedge count s =16,049,454,031
Claw count z =119,315,275,422,022
Cross count x =1,448,037,716,964,535,296
Triangle count t =1,632,458,682
Square count q =3,243,078,988,489
Maximum degree dmax =70,541
Maximum outdegree d+max =14,467
Maximum indegree d−max =70,540
Average degree d =48.661 4
Fill p =7.327 26 × 10−5
Size of LCC N =331,411
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.363 78
90-Percentile effective diameter δ0.9 =4.658 60
Median distance δM =4
Mean distance δm =3.842 81
Balanced inequality ratio P =0.107 428
Outdegree balanced inequality ratio P+ =0.132 494
Indegree balanced inequality ratio P− =0.105 398
Relative edge distribution entropy Her =0.790 938
Degree assortativity ρ =−0.074 104 4
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.699 127
Clustering coefficient c =0.305 143
Directed clustering coefficient c± =0.944 273
Spectral norm α =2,907.45
Operator 2-norm ν =1,902.26
Cyclic eigenvalue π =1,002.44
Reciprocity y =0.334 080
Non-bipartivity bA =0.690 935
Normalized non-bipartivity bN =0.017 262 0
Controllability C =207,909
Relative controllability Cr =0.626 124

Plots

Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Spectral graph drawing based on the normalized adjacency matrix

Zipf plot

Hop distribution

Double Laplacian graph drawing

In/outdegree scatter plot

Clustering coefficient 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 ]