Memory order decomposition of symbolic sequences
نویسندگان
چکیده
We introduce a general method for the study of memory in symbolic sequences based on higher-order Markov analysis. The process that best represents sequence is expressed as mixture matrices minimal orders, enabling definition so-called profile, which unambiguously reflects true order correlations. validated by recovering profiles tunable synthetic sequences. Finally, we scan real data and showcase with practical examples how our protocol can be used to extract relevant stochastic properties
منابع مشابه
Information decomposition of symbolic sequences
We developed a non-parametric method of Information Decomposition (ID) of a content of any symbolical sequence. The method is based on the calculation of Shannon mutual information between analyzed and artificial symbolical sequences, and allows the revealing of latent periodicity in any symbolical sequence. We show the stability of the ID method in the case of a large number of random letter c...
متن کاملSimilarity of symbolic sequences
A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences a patterns. The set of subsequences common for two symbolic sequences (their intersection) is proposed as a measure of similarity between them. The new similarity measure works w...
متن کاملSymmetry Studies of Symbolic Sequences
Data-analytic interpretations for the canonical projections (or decomposition) theorem for finite groups are illustrated in the study of data indexed by dihedral permutations of three and four symbols. The purpose of this paper is to apply and develop the methodology of symmetry studies to the analysis of data indexed by those permutations, both descriptively and for statistical inference under...
متن کاملPhysical Complexity of Symbolic Sequences
A practical measure for the complexity of sequences of symbols (“strings”) is introduced that is rooted in automata theory but avoids the problems of Kolmogorov–Chaitin complexity. This physical complexity can be estimated for ensembles of sequences, for which it reverts to the difference between the maximal entropy of the ensemble and the actual entropy given the specific environment within wh...
متن کاملSymbolic Analysis with Circuit Decomposition
Abstract This paper deals with computational complexity of approximate symbolic analysis. A method for symbolic approximation that exploits the sparsity of circuit matrix to achieve an acceptable speed for large circuits is proposed. The method is based on gradual simplification of a block-decomposed circuit model in the frequency domain. The simplified model is then analyzed symbolically. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2021
ISSN: ['1550-2376', '1539-3755']
DOI: https://doi.org/10.1103/physreve.104.014112