Statistical complexity and Fisher-Shannon information measure of \(H^{+}_{2}\)
From MaRDI portal
Publication:637279
DOI10.1016/j.physleta.2007.11.041zbMath1220.94029MaRDI QIDQ637279
K. D. Sen, H. E. jun. Montgomery
Publication date: 2 September 2011
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physleta.2007.11.041
Related Items
Quantum tunneling and information entropy in a double square well potential: the ammonia molecule, Complexity Invariance by Replication in the Quantum Square Well, Quantum information entropies for the \(\ell \)-state Pöschl-Teller-type potential, Statistical measures and the Klein tunneling in single-layer graphene, Shannon and Fisher entropies for a hydrogen atom under soft spherical confinement, Statistical complexity and Fisher-Shannon information in the H-atom, Fisher-Rényi entropy product and information plane, Complexity and white-dwarf structure, A simple method for the evaluation of the information content and complexity in atoms. A proposal for scalability, Alternative evaluation of statistical indicators in atoms: the non-relativistic and relativistic cases, Comparative characterization of two-electron wavefunctions using information-theory measures, Systematic study of information measures, statistical complexity and atomic structure properties, Relativistic effects on information measures for hydrogen-like atoms, Comments on ``Statistical complexity and Fisher-Shannon information measure of \({\mathrm H_2}^+\), Reply to ``Comments on `Statistical complexity and Fisher-Shannon information measure of \({\mathrm H_2}^+\)' , Evidence of Magic Numbers in Nuclei by Statistical Indicators
Cites Work
- Unnamed Item
- Net Fisher information measure versus ionization potential and dipole polarizability in atoms
- Fisher information as a measure of time
- Information theory in living systems, methods, applications, and challenges
- Information-theoretic measures of hyperspherical harmonics
- Information theoretic inequalities
- A statistical complexity measure with nonextensive entropy and quasi-multiplicativity
- On the Length of Programs for Computing Finite Binary Sequences
