Connections between Classical and Parametric Network Entropies

This paper explores relationships between classical and parametric measures of graph (or network) complexity. Classical measures are based on vertex decompositions induced by equivalence relations. Parametric measures, on the other hand, are constructed by using information functions to assign proba...

Descripción completa

Detalles Bibliográficos
Autores principales: Dehmer, Matthias, Mowshowitz, Abbe, Emmert-Streib, Frank
Formato: Texto
Lenguaje:English
Publicado: Public Library of Science 2011
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3016402/
https://www.ncbi.nlm.nih.gov/pubmed/21246046
http://dx.doi.org/10.1371/journal.pone.0015733
Descripción
Sumario:This paper explores relationships between classical and parametric measures of graph (or network) complexity. Classical measures are based on vertex decompositions induced by equivalence relations. Parametric measures, on the other hand, are constructed by using information functions to assign probabilities to the vertices. The inequalities established in this paper relating classical and parametric measures lay a foundation for systematic classification of entropy-based measures of graph complexity.

Ejemplares similares