Abstract
This paper introduces an extension of recurrence analysis to symbolic sequences. Heuristic arguments based on Shannon–McMillan–Breiman theorem suggest several relations between the statistical features of "symbolic" recurrence plots and the entropy per unit time of the dynamics; their practical efficiency for experimental sequences of finite length is checked numerically on two paradigmatic models, namely discretized logistic map trajectories and Markov chains, and also on experimental behavioral sequences. Specific advantages of RP analysis are presented, among which is the detection of nonstationary features.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Bifurcation and Chaos [In Applied Sciences and Engineering]
Paper Title
Journal
Date
