The properties of a statistical complexity measure that are characterized by nonextensivity in entropy have been investigated, which is of so-called disequilibrium type. Considering the composition law for two systems with different nonextensivities (quasi-multiplicativity), a nontrivial relation between the nonextensive parameters and the fluctuating bit number in information theory has been mentioned. To see the time evolution of the nonextensive complexity measure, we examine systems having a lognormal distribution, the underlying dynamics for which is known to obey a random multiplicative process in the presence of a boundary constraint.
No takes yet. Share an insight, caveat, or question.
Takuya Yamano (2004) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: