𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Thermostatistical aspects of generalized entropies

✍ Scribed by K.S. Fa; E.K. Lenzi


Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
274 KB
Volume
20
Category
Article
ISSN
0960-0779

No coin nor oath required. For personal study only.

✦ Synopsis


We investigate the properties concerning a class of generalized entropies given by S q;r ¼ kf1 À ½ P i p q i r g=½rðq À 1Þ which include TsallisÕ entropy (r ¼ 1), the usual Boltzmann-Gibbs entropy (q ¼ 1), R e enyiÕs entropy (r ¼ 0) and normalized TsallisÕ entropy (r ¼ À1). In order to obtain the generalized thermodynamic relations we use the laws of thermodynamics and considering the hypothesis that the joint probability of two independent systems is given by p

We show that the transmutation which occurs from TsallisÕ entropy to R e enyiÕs entropy also occur with S q;r . In this scenario, we also analyze the generalized variance, covariance and correlation coefficient of a non-interacting system by using extended optimal Lagrange multiplier approach. We show that the correlation coefficient tends to zero in the thermodynamic limit. However, R e enyiÕs entropy related to this non-interacting system presents a certain degree of non-extensivity.


📜 SIMILAR VOLUMES


Thermodynamic stabilities of the general
✍ Tatsuaki Wada 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 184 KB

We consider the thermodynamic stability conditions (TSC) on the Boltzmann entropies generalized by Tsallis' q-and Kaniadakis' Ä-deformed logarithmic functions. It is shown that the corresponding TSCs are not necessarily equivalent to the concavity of the generalized Boltzmann entropies with respect

Two entropies of a generalized sorting p
✍ Akihiro Nozaki 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 248 KB

In this paper we introduce a class of generalized sorting (ordering) problems called "classifications." To each "classification," we associate two quantities: informational entropy (average information quantity) and operational entropy (measure of computational complexity, that is, number of compari