IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v36y2008i1p32-41.html
   My bibliography  Save this article

Symbolic sequence analysis using approximated partition

Author

Listed:
  • Letellier, Christophe

Abstract

A particular attention has been paid to characterizing the dynamical behavior using symbolic sequences when there is no topological criterion to define the partition. In that case, a so-called threshold crossings technique is used. It is shown that maximizing the number of realized sequences provides a partition closer to the topological partition than using a partition leading to equiprobable symbols. After numerical evidences on benchmark maps, an experimental time series from a copper electrodissolution is used to check the applicability of this technique.

Suggested Citation

  • Letellier, Christophe, 2008. "Symbolic sequence analysis using approximated partition," Chaos, Solitons & Fractals, Elsevier, vol. 36(1), pages 32-41.
    • Handle: RePEc:eee:chsofr:v:36:y:2008:i:1:p:32-41
    DOI: 10.1016/j.chaos.2006.06.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077906005844
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2006.06.025?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ghazimirsaied, Ahmad & Koch, Charles Robert, 2012. "Controlling cyclic combustion timing variations using a symbol-statistics predictive approach in an HCCI engine," Applied Energy, Elsevier, vol. 92(C), pages 133-146.
    2. Tlaie, A. & Ballesteros-Esteban, L.M. & Leyva, I. & Sendiña-Nadal, I., 2019. "Statistical complexity and connectivity relationship in cultured neural networks," Chaos, Solitons & Fractals, Elsevier, vol. 119(C), pages 284-290.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:36:y:2008:i:1:p:32-41. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.