A statistical complexity measure with nonextensive entropy and quasi-multiplicativity
From MaRDI portal
Publication:4833401
DOI10.1063/1.1695600zbMath1071.94005OpenAlexW2025355414MaRDI QIDQ4833401
Publication date: 15 December 2004
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.1695600
Foundations of time-dependent statistical mechanics (82C03) Measures of information, entropy (94A17)
Related Items (15)
Information-theoretic measures for a position-dependent mass system in an infinite potential well ⋮ Complexity-like properties and parameter asymptotics of Lq -norms of Laguerre and Gegenbauer polynomials ⋮ Monotone measures of statistical complexity ⋮ Systematic study of information measures, statistical complexity and atomic structure properties ⋮ Complexity and neutron star structure ⋮ Biparametric complexities and generalized Planck radiation law ⋮ Statistical complexity and Fisher-Shannon information measure of \(H^{+}_{2}\) ⋮ Quantum similarity index and Rényi complexity ratio of Kratzer type potential and compared with that of inverse square and Coulomb type potentials ⋮ Information-theoretical complexity for the hydrogenic identity \(S_N2\) exchange reaction ⋮ Complexity measures and uncertainty relations of the high-dimensional harmonic and hydrogenic systems ⋮ Entropy and complexity analysis of hydrogenic Rydberg atoms ⋮ Fisher-Shannon plane and statistical complexity of atoms ⋮ Some complexity measures in confined isotropic harmonic oscillator ⋮ A generalized statistical complexity based on Rényi entropy of a noncommutative anisotropic oscillator in a homogeneous magnetic field ⋮ Complexity analysis of hypergeometric orthogonal polynomials
Cites Work
- Information measures, effective complexity, and total information
- Toward a quantitative theory of self-generated complexity
- What is complexity?
- Possible generalization of Boltzmann-Gibbs statistics.
- Measures of statistical complexity: why?
- Some features of the López-Ruiz-Mancini-Calbet (LMC) statistical measure of complexity.
- On the Complexity of Finite Sequences
- On aq-generalization of circular and hyperbolic functions
- On the Length of Programs for Computing Finite Binary Sequences
- Nonextensive thermodynamic relations
- Entropic nonextensivity: A possible measure of complexity
- Mixing and equilibration: protagonists in the scene of nonextensive statistical mechanics
This page was built for publication: A statistical complexity measure with nonextensive entropy and quasi-multiplicativity
