Cargando…
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...
Autores principales: | Dehmer, Matthias, Mowshowitz, Abbe, Emmert-Streib, Frank |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2011
|
Materias: | |
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 |
Ejemplares similares
-
On Properties of Distance-Based Entropies on Fullerene Graphs
por: Ghorbani, Modjtaba, et al.
Publicado: (2019) -
A Note on Graphs with Prescribed Orbit Structure
por: Mowshowitz, Abbe, et al.
Publicado: (2019) -
Entropy Bounds for Hierarchical Molecular Networks
por: Dehmer, Matthias, et al.
Publicado: (2008) -
Measuring the complexity of directed graphs: A polynomial-based approach
por: Dehmer, Matthias, et al.
Publicado: (2019) -
The Discrimination Power of Structural SuperIndices
por: Dehmer, Matthias, et al.
Publicado: (2013)