Occupations
This is the bipartite occupation network of DBpedia. It contains persons and
occupations as nodes, and an edge denotes that a person has an occupation. The
edges correspond to the <http://dbpedia.org/ontology/occupation>
relationships in DBpedia.
Metadata
Statistics
Size  n =  229,307

Left size  n_{1} =  127,577

Right size  n_{2} =  101,730

Volume  m =  250,945

Wedge count  s =  335,154,441

Claw count  z =  1,306,969,930,352

Cross count  x =  4,967,920,242,807,365

Square count  q =  24,509,245

4Tour count  T_{4} =  1,537,212,834

Maximum degree  d_{max} =  17,997

Maximum left degree  d_{1max} =  24

Maximum right degree  d_{2max} =  17,997

Average degree  d =  2.188 73

Average left degree  d_{1} =  1.967 01

Average right degree  d_{2} =  2.466 77

Fill  p =  1.933 56 × 10^{−5}

Size of LCC  N =  143,220

Diameter  δ =  24

50Percentile effective diameter  δ_{0.5} =  4.383 41

90Percentile effective diameter  δ_{0.9} =  6.770 30

Median distance  δ_{M} =  5

Mean distance  δ_{m} =  5.198 51

Gini coefficient  G =  0.454 552

Balanced inequality ratio  P =  0.347 200

Left balanced inequality ratio  P_{1} =  0.392 126

Right balanced inequality ratio  P_{2} =  0.287 824

Relative edge distribution entropy  H_{er} =  0.859 208

Power law exponent  γ =  4.145 40

Tail power law exponent  γ_{t} =  1.761 00

Degree assortativity  ρ =  +0.028 052 2

Degree assortativity pvalue  p_{ρ} =  0.000 00

Spectral norm  α =  138.395

Algebraic connectivity  a =  0.003 010 06

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.250 24

Controllability  C =  45,292

Relative controllability  C_{r} =  0.271 380

Plots
Matrix decompositions plots
Downloads
References
[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.
