Wikipedia links (csb)

This network consists of the wikilinks of the Wikipedia in the Kashubian language (csb). 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_csb
NameWikipedia links (csb)
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
LoopsDoes not contain loops


Size n =5,561
Volume m =191,255
Loop count l =0
Wedge count s =73,144,299
Claw count z =11,170,205,206
Cross count x =1,362,333,962,685
Triangle count t =1,822,156
Square count q =6,815,937,168
4-Tour count T4 =54,820,449,078
Maximum degree dmax =1,154
Maximum outdegree d+max =396
Maximum indegree dmax =1,065
Average degree d =68.784 4
Fill p =0.006 185 65
Size of LCC N =5,437
Size of LSCC Ns =2,682
Relative size of LSCC Nrs =0.482 287
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.794 99
90-Percentile effective diameter δ0.9 =3.894 37
Median distance δM =3
Mean distance δm =3.316 09
Gini coefficient G =0.813 836
Balanced inequality ratio P =0.137 421
Outdegree balanced inequality ratio P+ =0.105 106
Indegree balanced inequality ratio P =0.118 533
Relative edge distribution entropy Her =0.824 042
Power law exponent γ =1.508 48
Tail power law exponent γt =1.501 00
Tail power law exponent with p γ3 =1.501 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =1.611 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =1.451 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =+0.265 971
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.363 906
Clustering coefficient c =0.074 735 4
Directed clustering coefficient c± =0.619 788
Spectral norm α =421.979
Operator 2-norm ν =402.532
Cyclic eigenvalue π =35.121 6
Algebraic connectivity a =0.126 222
Spectral separation 1[A] / λ2[A]| =1.069 50
Reciprocity y =0.041 682 6
Algebraic non-bipartivity χ =0.153 784
Spectral bipartite frustration bK =0.000 558 693
Controllability C =3,035
Relative controllability Cr =0.545 765


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 ]