Entropies from Markov models as complexity measures of embedded attractors

DOI10.3390/e17063595zbMath1343.62045arXiv1405.2987OpenAlexW1487397800MaRDI QIDQ296368

Julián D. Arias-Londoño, Juan-Ignacio Godino-Llorente

Publication date: 15 June 2016

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2987

Mathematics Subject Classification ID

Markov processes: hypothesis testing (62M02)

Uses Software

• PMTK
• PhysioToolkit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical mechanics and information-theoretic perspectives on complexity in the Earth system
• Multivariate multi-scale permutation entropy for complexity analysis of Alzheimer's disease EEG
• On some convergence properties of the subspace constrained mean shift
• The effect of time delay on approximate \& sample entropy calculations
• On the concept of attractor
• Practical method for determining the minimum embedding dimension of a scalar time series
• Entropy measures for biological signal analyses
• Hidden Markov Models and Dynamical Systems
• Approximate entropy as a measure of system complexity.
• Hidden Markov processes
• Adaptive Blind Deconvolution of Linear Channels Using Renyi's Entropy with Parzen Window Estimation
• Elements of Information Theory
• Chaos

This page was built for publication: Entropies from Markov models as complexity measures of embedded attractors