Wikipedia links (bpy)

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


Internal namewikipedia_link_bpy
NameWikipedia links (bpy)
Data source
AvailabilityDataset is available for download
Consistency checkDataset failed tests: *** No loop found although #loop is set
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops


Size n =25,359
Volume m =2,411,129
Loop count l =0
Wedge count s =2,539,916,990
Claw count z =4,024,579,456,566
Cross count x =6,341,306,162,682,665
Triangle count t =207,564,732
Square count q =229,609,748,961
4-Tour count T4 =1,847,041,575,702
Maximum degree dmax =13,808
Maximum outdegree d+max =927
Maximum indegree dmax =13,796
Average degree d =190.160
Fill p =0.003 749 50
Size of LCC N =25,338
Size of LSCC Ns =12,361
Relative size of LSCC Nrs =0.487 440
Diameter δ =11
50-Percentile effective diameter δ0.5 =1.852 81
90-Percentile effective diameter δ0.9 =2.802 51
Mean distance δm =2.451 19
Gini coefficient G =0.685 563
Relative edge distribution entropy Her =0.896 802
Power law exponent γ =1.265 36
Tail power law exponent γt =1.981 00
Degree assortativity ρ =−0.253 599
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.492 321
Clustering coefficient c =0.245 163
Directed clustering coefficient c± =0.933 110
Spectral norm α =1,314.33
Operator 2-norm ν =948.182
Cyclic eigenvalue π =383.000
Algebraic connectivity a =0.009 429 39
Reciprocity y =0.375 842
Non-bipartivity bA =0.557 060
Normalized non-bipartivity bN =0.030 059 1
Spectral bipartite frustration bK =9.198 82 × 10−5
Controllability C =14,607
Relative controllability Cr =0.576 009


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

Matrix decompositions plots



[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]