Wikipedia links (bcl)

This network consists of the wikilinks of the Wikipedia in the Central Bikol language (bcl). 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_bcl
NameWikipedia links (bcl)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
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 =7,937
Volume m =347,674
Loop count l =5
Wedge count s =48,789,302
Claw count z =35,871,357,454
Cross count x =7,953,290,809,577
Triangle count t =12,039,540
Square count q =2,872,431,915
4-Tour count T4 =23,175,008,292
Maximum degree dmax =2,297
Maximum outdegree d+max =1,580
Maximum indegree dmax =2,256
Average degree d =87.608 4
Fill p =0.005 518 99
Size of LCC N =7,876
Size of LSCC Ns =5,451
Relative size of LSCC Nrs =0.686 783
Diameter δ =15
50-Percentile effective diameter δ0.5 =2.962 64
90-Percentile effective diameter δ0.9 =4.033 45
Median distance δM =3
Mean distance δm =3.439 89
Gini coefficient G =0.738 091
Relative edge distribution entropy Her =0.878 103
Power law exponent γ =1.373 08
Tail power law exponent γt =2.051 00
Degree assortativity ρ =+0.060 828 3
Degree assortativity p-value pρ =5.335 91 × 10−321
In/outdegree correlation ρ± =+0.836 727
Clustering coefficient c =0.740 298
Directed clustering coefficient c± =0.977 298
Spectral norm α =756.530
Operator 2-norm ν =379.499
Cyclic eigenvalue π =377.032
Algebraic connectivity a =0.022 083 0
Reciprocity y =0.861 666
Non-bipartivity bA =0.921 739
Normalized non-bipartivity bN =0.040 989 9
Spectral bipartite frustration bK =0.000 398 004


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


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 ]