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 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 =5,528
Volume m =191,008
Loop count l =0
Wedge count s =73,071,152
Claw count z =11,158,438,013
Cross count x =1,358,583,569,599
Triangle count t =1,814,680
Square count q =6,815,533,852
4-Tour count T4 =54,816,928,770
Maximum degree dmax =1,146
Maximum outdegree d+max =396
Maximum indegree dmax =1,057
Average degree d =69.105 6
Fill p =0.006 251 64
Size of LCC N =5,404
Size of LSCC Ns =2,663
Relative size of LSCC Nrs =0.481 729
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.765 27
90-Percentile effective diameter δ0.9 =3.886 02
Median distance δM =3
Mean distance δm =3.301 67
Gini coefficient G =0.813 583
Relative edge distribution entropy Her =0.823 978
Power law exponent γ =1.510 25
Tail power law exponent γt =1.501 00
Degree assortativity ρ =+0.259 738
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.370 624
Clustering coefficient c =0.074 503 3
Directed clustering coefficient c± =0.622 092
Spectral norm α =421.979
Operator 2-norm ν =402.532
Cyclic eigenvalue π =43.626 6
Algebraic connectivity a =0.126 226
Reciprocity y =0.045 390 8
Non-bipartivity bA =0.064 979 9
Normalized non-bipartivity bN =0.037 241 1
Spectral bipartite frustration bK =0.000 556 894


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 ]