Permutation Complexity via Duality between Values and Orderings

Details Permutation Complexity via Duality between Values and Orderings Permutation Complexity via Duality between Values and Orderings

2011-12-12

arxiv.org/abs/1112.2475v1

Physica D 240 (2011) 1370-1377

Nonlinear Sciences

Chaotic Dynamics

26 pages

Scientific paper

10.1016/j.physd.2011.05.019

We study the permutation complexity of finite-state stationary stochastic processes based on a duality between values and orderings between values. First, we establish a duality between the set of all words of a fixed length and the set of all permutations of the same length. Second, on this basis, we give an elementary alternative proof of the equality between the permutation entropy rate and the entropy rate for a finite-state stationary stochastic processes first proved in [Amigo, J.M., Kennel, M. B., Kocarev, L., 2005. Physica D 210, 77-95]. Third, we show that further information on the relationship between the structure of values and the structure of orderings for finite-state stationary stochastic processes beyond the entropy rate can be obtained from the established duality. In particular, we prove that the permutation excess entropy is equal to the excess entropy, which is a measure of global correlation present in a stationary stochastic process, for finite-state stationary ergodic Markov processes.

Affiliated with

Also associated with

No associations

Rating

Permutation Complexity via Duality between Values and Orderings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Permutation Complexity via Duality between Values and Orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutation Complexity via Duality between Values and Orderings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708641