DBpedia links

The network is the hyperlink network of Wikipedia, as extracted in DBpedia. Nodes are pages in Wikipedia and edges correspond to hyperlinks (also known as wikilinks). The edges correspond to the <http://dbpedia.org/ontology/wikiPageWikiLink> relationships in DBpedia.


Internal namedbpedia-link
NameDBpedia links
Data sourcehttp://wiki.dbpedia.org/Downloads
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Hyperlink network
Dataset timestamp 2001 ⋯ 2017
Node meaningArticle
Edge meaningHyperlink
Network formatUnipartite, directed
Edge typeUnweighted, multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops


Size n =18,268,992
Volume m =172,183,984
Unique edge count m̿ =136,537,566
Loop count l =0
Wedge count s =583,124,689,932
Claw count z =58,569,969,947,022,656
Cross count x =7.535 44 × 1021
Triangle count t =328,743,411
Maximum degree dmax =632,558
Maximum outdegree d+max =9,300
Maximum indegree dmax =631,415
Average degree d =18.849 9
Fill p =4.090 94 × 10−7
Average edge multiplicity m̃ =1.261 07
Size of LCC N =18,265,512
Size of LSCC Ns =3,796,073
Relative size of LSCC Nrs =0.207 788
Diameter δ =12
50-Percentile effective diameter δ0.5 =4.200 09
90-Percentile effective diameter δ0.9 =4.983 39
Mean distance δm =4.629 76
Gini coefficient G =0.860 655
Balanced inequality ratio P =0.136 501
Outdegree balanced inequality ratio P+ =0.190 756
Indegree balanced inequality ratio P =0.138 531
Relative edge distribution entropy Her =0.870 730
Power law exponent γ =2.097 66
Tail power law exponent γt =2.371 00
Degree assortativity ρ =−0.014 932 2
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.001 691 29
Spectral norm α =3,599.75
Reciprocity y =0.141 314
Non-bipartivity bA =0.003 246 71
Normalized non-bipartivity bN =0.003 374 45


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

Degree assortativity

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 ]
[2] Sören Auer, Christian Bizer, Georgi Kobilarov, Jens Lehmann, Richard Cyganiak, and Zachary Ives. DBpedia: A nucleus for a web of open data. In Proc. Int. Semant. Web Conf., pages 722–735, 2008.