DBpedia locations

This is the bipartite network of entities in Wikipedia and their locations. The nodes of the network are entities and locations. Edges denote that an entity is associated with a location. Entity can have multiple locations, for instance cities associated with a company. The edges correspond to the <http://dbpedia.org/ontology/location> relationships in DBpedia.


Internal namedbpedia-location
NameDBpedia locations
Data sourcehttp://wiki.dbpedia.org/Downloads
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Feature network
Dataset timestamp 2001 ⋯ 2017
Node meaningEntity, place
Edge meaningLocation
Network formatBipartite, undirected
Edge typeUnweighted, no multiple edges


Size n =225,498
Left size n1 =172,091
Right size n2 =53,407
Volume m =293,697
Wedge count s =122,892,989
Claw count z =324,552,882,549
Cross count x =929,789,499,617,832
Square count q =3,761,594
4-Tour count T4 =522,254,610
Maximum degree dmax =12,189
Maximum left degree d1max =28
Maximum right degree d2max =12,189
Average degree d =2.604 87
Average left degree d1 =1.706 64
Average right degree d2 =5.499 22
Fill p =3.195 53 × 10−5
Size of LCC N =181,937
Diameter δ =27
50-Percentile effective diameter δ0.5 =5.948 20
90-Percentile effective diameter δ0.9 =8.770 09
Median distance δM =6
Mean distance δm =6.754 43
Gini coefficient G =0.540 934
Balanced inequality ratio P =0.305 049
Left balanced inequality ratio P1 =0.404 226
Right balanced inequality ratio P2 =0.187 612
Relative edge distribution entropy Her =0.888 942
Power law exponent γ =3.176 22
Tail power law exponent γt =2.011 00
Degree assortativity ρ =+0.082 583 3
Degree assortativity p-value pρ =0.000 00
Spectral norm α =111.155
Algebraic connectivity a =0.000 760 771
Spectral separation 1[A] / λ2[A]| =1.989 43
Controllability C =93,962
Relative controllability Cr =0.552 640


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

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.