Classification of Markov chains describing the evolution of random strings

DOI10.1070/RM1995V050N02ABEH001701zbMATH Open0856.60069MaRDI QIDQ4884259FDOQ4884259

Authors: A. S. Gajrat, K. D. Pelikh, V. A. Malyshev, Mikhail V. Menshikov 

Publication date: 17 February 1997

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3925922
• scientific article; zbMATH DE number 1166244
• scientific article; zbMATH DE number 4054748
• Conditions for the non-ergodicity of Markov chains with application to a communication system

zbMATH Keywords

branching processrecurrence and transienceconditions for ergodicity

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Discrete-time Markov processes on general state spaces (60J05)

Cited In (16)

• Title not available (Why is that?)
• Lyapunov functions for random walks and strings in random environment
• Title not available (Why is that?)
• The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing
• A scaling analysis of a cat and mouse Markov chain
• On mathematical models of the service networks
• Title not available (Why is that?)
• Dynamics of two interacting queues
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conditions for the non-ergodicity of Markov chains with application to a communication system
• Grammatical Inference: Algorithms and Applications
• Title not available (Why is that?)
• Necessary and sufficient conditions for the ergodicity of Markov chains with transition <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="$\Delta _{m,n} \left( {\Delta '_{m,n} } \right)$"><mml:mrow><mml:msub><mml:mi>Δ</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:msup><mml:mi>Δ</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi></…
• Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models
• Substitution operators

This page was built for publication: Classification of Markov chains describing the evolution of random strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4884259)