Wikipedia links (vec)

This network consists of the wikilinks of the Wikipedia in the Venetian language (vec). 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_vec
NameWikipedia links (vec)
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 =17,392
Volume m =290,633
Loop count l =134
Wedge count s =65,232,253
Claw count z =42,355,983,086
Cross count x =26,425,799,735,417
Triangle count t =2,651,528
Square count q =415,364,271
4-Tour count T4 =3,584,274,976
Maximum degree dmax =2,999
Maximum outdegree d+max =380
Maximum indegree dmax =2,999
Average degree d =33.421 5
Fill p =0.000 960 828
Size of LCC N =17,371
Size of LSCC Ns =10,738
Relative size of LSCC Nrs =0.617 410
Diameter δ =15
50-Percentile effective diameter δ0.5 =3.306 89
90-Percentile effective diameter δ0.9 =4.602 01
Median distance δM =4
Mean distance δm =3.798 45
Gini coefficient G =0.721 704
Relative edge distribution entropy Her =0.886 295
Power law exponent γ =1.507 21
Tail power law exponent γt =2.641 00
Degree assortativity ρ =−0.118 040
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.779 364
Clustering coefficient c =0.121 942
Directed clustering coefficient c± =0.648 962
Spectral norm α =262.297
Operator 2-norm ν =189.261
Cyclic eigenvalue π =114.347
Algebraic connectivity a =0.025 644 7
Reciprocity y =0.513 830
Non-bipartivity bA =0.423 746
Normalized non-bipartivity bN =0.070 440 5
Spectral bipartite frustration bK =0.001 221 88


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 ]