On uniqueness theorems for Tsallis entropy and Tsallis relative entropy
arXiv:cond-mat/0410270 · doi:10.1109/TIT.2005.855606
Abstract
The uniqueness theorem for Tsallis entropy was presented in {\it H.Suyari, IEEE Trans. Inform. Theory, Vol.50, pp.1783-1787 (2004)} by introducing the generalized Shannon-Khinchin's axiom. In the present paper, this result is generalized and simplified as follows: {\it Generalization}: The uniqueness theorem for Tsallis relative entropy is shown by means of the generalized Hobson's axiom. {\it Simplification}: The uniqueness theorem for Tsallis entropy is shown by means of the generalized Faddeev's axiom.
this was merged by two manuscripts (arXiv:cond-mat/0410270 and arXiv:cond-mat/0410271), and will be published from IEEE TIT
References in corpus (1)
Cited by in corpus (19)
- A Characterization of Entropy in Terms of Information Loss
- Nonextensive triangle equality and other properties of Tsallis relative-entropy minimization
- On entropy, entropy-like quantities, and applications
- Gravity from thermodynamics: optimal transport and negative effective dimensions
- An axiomatic characterization of a two-parameter extended relative entropy
- Affinity-based extension of non-extensive entropy and statistical mechanics
- A generalized Fannes inequality
- On some properties of Tsallis hypoentropies and hypodivergences
- Use of the geometric mean as a statistic for the scale of the coupled Gaussian distributions
- Some inequalities on generalized entropies
- Properties of a Generalized Divergence Related to Tsallis Relative Entropy
- Conditions for the existence of a generalization of Rényi divergence
- Entropy and Diversity: The Axiomatic Approach
- Inequalities related to some types of entropies and divergences
- Reconciling fractional entropy and black hole entropy compositions
- A two-parameter entropy and its fundamental properties
- Characterizations of generalized entropy functions by functional equations
- A characterization of the relative entropies
- Deformed Statistics Formulation of the Information Bottleneck Method