pith. sign in

arxiv: nlin/0312056 · v1 · pith:EI5AFH5Pnew · submitted 2003-12-22 · 🌊 nlin.AO · cond-mat.stat-mech· cs.IT· math.IT· nlin.CD· physics.comp-ph· q-bio.QM

Shannon information, LMC complexity and Renyi entropies: a straightforward approach

classification 🌊 nlin.AO cond-mat.stat-mechcs.ITmath.ITnlin.CDphysics.comp-phq-bio.QM
keywords complexityindicatorapproachentropiesrenyistraightforwardadvantagesallows
0
0 comments X
read the original abstract

The LMC complexity, an indicator of complexity based on a probabilistic description, is revisited. A straightforward approach allows us to establish the time evolution of this indicator in a near-equilibrium situation and gives us a new insight for interpreting the LMC complexity for a general non equilibrium system. Its relationship with the Renyi entropies is also explained. One of the advantages of this indicator is that its calculation does not require a considerable computational effort in many cases of physical and biological interest.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.