Equivalence of the Markov chains and two-sided symbolic sequences

2006 ◽  
Vol 76 (6) ◽  
pp. 1015-1021 ◽  
Author(s):  
S. S Apostolov ◽  
Z. A Mayzelis ◽  
O. V Usatenko ◽  
V. A Yampol'skii
Keyword(s):  
Markov Chains ◽  
Symbolic Sequences

RECURRENCE PLOTS FOR SYMBOLIC SEQUENCES

2010 ◽  
Vol 20 (06) ◽  
pp. 1731-1749 ◽  
Author(s):  
PHILIPPE FAURE ◽  
ANNICK LESNE
Keyword(s):  
Markov Chains ◽  
Finite Length ◽  
Logistic Map ◽  
Statistical Features ◽  
Recurrence Plots ◽  
Recurrence Analysis ◽  
Symbolic Sequences ◽  
Behavioral Sequences

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.

Markov models—Markov chains

2019 ◽  
Vol 16 (8) ◽  
pp. 663-664 ◽  
Author(s):  
Jasleen K. Grewal ◽  
Martin Krzywinski ◽  
Naomi Altman
Keyword(s):  
Markov Chains ◽  
Markov Models

Transient Solution of Acyclic Markov Chains.

1985 ◽  
Author(s):  
Raymond Marie ◽  
Andrew Reibman ◽  
Kishor Trivedi
Keyword(s):  
Markov Chains ◽  
Transient Solution
Sign in / Sign up

Export Citation Format

Share Document