Lattice complexity and fine graining of symbolic sequence

Abstract

A new complexity measure named as Lattice Complexity is presented for finite symbolic sequences. This measure is based on the symbolic dynamics of one-dimensional iterative maps and Lempel-Ziv Complexity. To make Lattice Complexity distinguishable from Lempel-Ziv Complexity, an approach called fine-graining process is also proposed. When the control parameter fine-graining order is small enough, the two measures are almost equal. While the order increases, the difference between the two measures becomes more and more significant. Applying Lattice Complexity to logistic map with a proper order, we find that the sequences that are regarded as complex are roughly at the edges of chaotic regions. Further derived properties of the two measures concerning the fine-graining process are also discussed.