Estimating a generating partition from observed time series: Symbolic shadowing

Y. Hirata, Kevin Judd, D. Kilminster

Research output: Contribution to journalArticle

48 Citations (Scopus)

Abstract

We propose a deterministic algorithm for approximating a generating partition from a time series using tessellations. Using data generated by Hénon and Ikeda maps, we demonstrate that the proposed method produces partitions that uniquely encode all the periodic points up to some order, and provide good estimates of the metric and topological entropies. The algorithm gives useful results even with a short noisy time series.
Original languageEnglish
Pages (from-to)online - approx 5-20pp
JournalPhysical Review E.
Volume70
Issue number1
DOIs
Publication statusPublished - 2004

Fingerprint Dive into the research topics of 'Estimating a generating partition from observed time series: Symbolic shadowing'. Together they form a unique fingerprint.

  • Cite this