Wikipedia links (de)

This network consists of the wikilinks of the Wikipedia in the German language (de). 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_de
NameWikipedia links (de)
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 =3,603,726
Volume m =96,865,851
Loop count l =33,552
Wedge count s =449,935,697,952
Claw count z =35,299,901,445,433,764
Cross count x =3.220 33 × 1021
Triangle count t =1,196,536,118
Maximum degree dmax =434,249
Maximum outdegree d+max =6,642
Maximum indegree dmax =434,205
Average degree d =53.758 7
Fill p =7.845 52 × 10−6
Size of LCC N =3,601,538
Size of LSCC Ns =2,211,883
Relative size of LSCC Nrs =0.685 735
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.321 20
90-Percentile effective diameter δ0.9 =4.448 62
Median distance δM =4
Mean distance δm =3.804 13
Gini coefficient G =0.742 213
Balanced inequality ratio P =0.201 695
Outdegree balanced inequality ratio P+ =0.227 508
Indegree balanced inequality ratio P =0.185 012
Relative edge distribution entropy Her =0.899 738
Power law exponent γ =1.448 83
Tail power law exponent γt =2.381 00
Degree assortativity ρ =−0.024 715 8
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.007 978 05
Directed clustering coefficient c± =0.271 761
Spectral norm α =1,663.52
Operator 2-norm ν =1,052.15
Reciprocity y =0.395 336
Non-bipartivity bA =0.404 311
Normalized non-bipartivity bN =0.025 022 7


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 normalized adjacency matrix

Hop distribution

In/outdegree scatter plot

Edge weight/multiplicity 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 ]