Asymptotic properties of words in semi-Markov sequences

DOI10.1142/S1793524522500139zbMath1492.92052OpenAlexW4220682993MaRDI QIDQ5866010

Brenda Ivette Garcia Maya, Margarita Karaliopoulou, Nikolaos Limnios

Publication date: 10 June 2022

Published in: International Journal of Biomathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793524522500139

zbMATH Keywords

strong law of large numberscentral limit theoremergodic theoremsemi-Markov chainembedded prefix chainhitting time of a set of words

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Protein sequences, DNA sequences (92D20)

Cites Work

• Semi-Markov chains and hidden semi-Markov models toward applications. Their use in reliability and DNA analysis.
• Variance estimation in the central limit theorem for Markov chains
• Motif statistics.
• Strong law of large numbers for hidden Markov chains indexed by Cayley trees
• Species abundance distribution results from a spatial analogy of central limit theorem
• Probability Models for DNA Sequence Evolution
• On Discrete Time Semi-Markov Chains and Applications in Words Occurrences
• The deterministic limit of the Moran model: a uniform central limit theorem
• Discrete-Time Semi-Markov Model for Reliability and Survival Analysis
• Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
• On the number of word occurrences in a semi-Markov sequence of letters
• On the estimation of spread rate for a biological population

This page was built for publication: Asymptotic properties of words in semi-Markov sequences