Distances in probability space and the statistical complexity setup
Summary: Statistical complexity measures (SCM) are the composition of two ingredients: (i) entropies and (ii) distances in probability-space. In consequence, SCMs provide a simultaneous quantification of the randomness and the correlational structures present in the system under study. We address in this review important topics underlying the SCM structure, viz., (a) a good choice of probability metric space and (b) how to assess the best distance-choice, which in this context is called a ``disequilibrium and is denoted with the letter \(\mathcal Q\). \(\mathcal Q\), indeed the crucial SCM ingredient, is cast in terms of an associated distance \(\mathcal D\). Since out input data consists of time-series, we also discuss the best way of extracting from the time series a probability distribution \(P\). As an illustration, we show just how these issues affect the description of the classical limit of quantum mechanics.
- A comparative classification of complexity measures
- Bandt-Pompe approach to the classical-quantum transition
- Classical Limit and Chaotic Regime in a Semi-Quantum Hamiltonian
- Classical limits
- Decoherence, einselection, and the quantum origins of the classical
- Generalized statistical complexity measure
- Measures of statistical complexity: why?
- Microstructure reconstruction using entropic descriptors
- On Information and Sufficiency
- On the Complexity of Finite Sequences
- Some features of the López-Ruiz-Mancini-Calbet (LMC) statistical measure of complexity.
- Statistical complexity and disequilibrium
- Toward a quantitative theory of self-generated complexity
- Wavelet statistical complexity analysis of the classical limit
- Statistical complexity measures as telltale of relevant scales in emergent dynamics of spatial systems
- Statistical complexity and disequilibrium
- Statistical complexity of the kicked top model considering chaos
- Statistical complexity of the quasiperiodical damped systems
- scientific article; zbMATH DE number 6474904 (Why is no real title available?)
- Characterizing dynamical transitions by statistical complexity measures based on ordinal pattern transition networks
- Generalized statistical complexity measure
- Permutation entropy and its main biomedical and econophysics applications: a review
- Distinguishability notion based on Wootters statistical distance: application to discrete maps
- Detecting regular and chaotic behaviour in the parameter space by generalised statistical complexity measures
- Statistical complexity of the time dependent damped L84 model
- Quantifying time series complexity by multi-scale transition network approaches
- Nonlinearity of the non-abelian lattice gauge field theory according to the spectrum of Kolmogorov-Sinai entropy and complexity
- A new spectral measure of complexity and its capabilities for detecting signals in noise
- Shrimp structure as a test bed for ordinal pattern measures
- Complexity measure of extreme events
This page was built for publication: Distances in probability space and the statistical complexity setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400868)
