Wikipedia links (bh)

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

CodeWbh
Internal namewikipedia_link_bh
NameWikipedia links (bh)
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 =15,581
Volume m =382,620
Loop count l =12
Wedge count s =85,192,240
Claw count z =19,393,178,499
Cross count x =5,123,116,867,029
Triangle count t =6,584,619
Square count q =5,604,417,634
4-Tour count T4 =45,176,713,016
Maximum degree dmax =2,528
Maximum outdegree d+max =428
Maximum indegree dmax =2,260
Average degree d =49.113 7
Fill p =0.001 576 08
Size of LCC N =15,568
Size of LSCC Ns =6,566
Relative size of LSCC Nrs =0.421 411
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.673 21
90-Percentile effective diameter δ0.9 =5.034 01
Median distance δM =4
Mean distance δm =4.167 52
Gini coefficient G =0.803 184
Balanced inequality ratio P =0.166 503
Outdegree balanced inequality ratio P+ =0.147 010
Indegree balanced inequality ratio P =0.193 186
Relative edge distribution entropy Her =0.859 959
Power law exponent γ =1.532 72
Tail power law exponent γt =1.541 00
Tail power law exponent with p γ3 =1.541 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =1.531 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.121 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =+0.108 844
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.650 962
Clustering coefficient c =0.231 874
Directed clustering coefficient c± =0.864 544
Spectral norm α =424.985
Operator 2-norm ν =382.840
Cyclic eigenvalue π =131.031
Algebraic connectivity a =0.038 394 7
Spectral separation 1[A] / λ2[A]| =1.240 08
Reciprocity y =0.424 034
Non-bipartivity bA =0.193 599
Normalized non-bipartivity bN =0.018 429 7
Algebraic non-bipartivity χ =0.056 609 5
Spectral bipartite frustration bK =0.000 365 385
Controllability C =7,092
Relative controllability Cr =0.455 170

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

Double Laplacian graph drawing

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 ]