Data Compression, Dynamics, and Stationarity

Matthew B. Kennel and Alistair I. Mees

Chapter Chapter 16 in Nonlinear Dynamics and Statistics, 2001, pp 387-412 from Springer

Abstract: Abstract One of the main themes of this book is the considerable progress that has been made in modeling data from nonlinear systems that may be affected by noise. In this chapter, we describe a modeling method based on an idealization that gives fast algorithms with known properties based on rigorous results from data-compression theory. The idealization is that the system outputs symbols from a finite alphabet, rather than outputting a real number; we also make a reasonable assumption which is the discrete analogue of the standard embedding theorem. The models that result can be used to simulate and to estimate many of the usual dynamically interesting quantities such as topological entropy. They are also well-suited for a specific new application: testing the stationarity of time-series of discrete symbols, whether two data streams appear to originate from the same underlying unknown dynamical system.

Keywords: Data Compression; Strange Attractor; Code Length; Topological Entropy; Chaotic Time Series (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-0177-9_16

Ordering information: This item can be ordered from
http://www.springer.com/9781461201779

DOI: 10.1007/978-1-4612-0177-9_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().