Genres (DBpedia)
This is the bipartite genre network from DBpedia. The nodes in the network are
works and artists, as well as genres from music, film and other areas. Each
edge connects a work or artist to a genre. The edges correspond to the
<http://dbpedia.org/ontology/genre> relationships in DBpedia.
Metadata
Statistics
Size  n =  266,717

Left size  n_{1} =  258,934

Right size  n_{2} =  7,783

Volume  m =  463,497

Wedge count  s =  1,331,590,538

Claw count  z =  6,667,061,771,791

Cross count  x =  32,482,545,125,451,776

Square count  q =  54,299,350

4Tour count  T_{4} =  5,761,771,762

Maximum degree  d_{max} =  24,821

Maximum left degree  d_{1max} =  31

Maximum right degree  d_{2max} =  24,821

Average degree  d =  3.475 57

Average left degree  d_{1} =  1.790 02

Average right degree  d_{2} =  59.552 5

Fill  p =  0.000 229 991

Size of LCC  N =  259,138

Diameter  δ =  32

50Percentile effective diameter  δ_{0.5} =  3.706 53

90Percentile effective diameter  δ_{0.9} =  7.435 10

Median distance  δ_{M} =  4

Mean distance  δ_{m} =  5.076 13

Gini coefficient  G =  0.645 943

Balanced inequality ratio  P =  0.258 995

Left balanced inequality ratio  P_{1} =  0.377 167

Right balanced inequality ratio  P_{2} =  0.073 191 4

Relative edge distribution entropy  H_{er} =  0.773 524

Power law exponent  γ =  3.236 04

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

Degree assortativity  ρ =  −0.078 141 0

Degree assortativity pvalue  p_{ρ} =  0.000 00

Spectral norm  α =  171.978

Algebraic connectivity  a =  0.001 674 73

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.223 27

Controllability  C =  251,772

Relative controllability  C_{r} =  0.944 551

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.
