A statistical measure of complexity with nonextensive entropy

✍ Scribed by Takuya Yamano

• Publisher: Elsevier Science
• Year: 2004
• Tongue: English
• Weight: 217 KB
• Volume: 340
• Category: Article
• ISSN: 0378-4371
• DOI: 10.1016/j.physa.2004.03.087

✦ Synopsis

A statistical measure of complexity utilising the concept of entropy or information is proposed. Our way in this study is to use a nonextensive entropy instead of an extensive (additive) Shannon entropy in the deÿnition, but can be characterised as a di erence between the qth-order RÃ enyi entropy and the second one. Furthermore, we devise a conditional, joint, and mutual complexity measure as a coherent possibility. The behavior of the measure for the logistic map shows that it is more sensitive to nonextensivity at the transition point ac ∼ 3:8284 : : : than any other values when 0 ¡ q ¡ 1.