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
_version_ 1782195741246095360
author Dehmer, Matthias
Mowshowitz, Abbe
Emmert-Streib, Frank
author_facet Dehmer, Matthias
Mowshowitz, Abbe
Emmert-Streib, Frank
author_sort Dehmer, Matthias
collection PubMed
description 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.
format Text
id pubmed-3016402
institution National Center for Biotechnology Information
language English
publishDate 2011
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-30164022011-01-18 Connections between Classical and Parametric Network Entropies Dehmer, Matthias Mowshowitz, Abbe Emmert-Streib, Frank PLoS One Research Article 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. Public Library of Science 2011-01-05 /pmc/articles/PMC3016402/ /pubmed/21246046 http://dx.doi.org/10.1371/journal.pone.0015733 Text en Dehmer et al. http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are properly credited.
spellingShingle Research Article
Dehmer, Matthias
Mowshowitz, Abbe
Emmert-Streib, Frank
Connections between Classical and Parametric Network Entropies
title Connections between Classical and Parametric Network Entropies
title_full Connections between Classical and Parametric Network Entropies
title_fullStr Connections between Classical and Parametric Network Entropies
title_full_unstemmed Connections between Classical and Parametric Network Entropies
title_short Connections between Classical and Parametric Network Entropies
title_sort connections between classical and parametric network entropies
topic Research Article
url 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
work_keys_str_mv AT dehmermatthias connectionsbetweenclassicalandparametricnetworkentropies
AT mowshowitzabbe connectionsbetweenclassicalandparametricnetworkentropies
AT emmertstreibfrank connectionsbetweenclassicalandparametricnetworkentropies

Ejemplares similares