Ergodicity coefficient and perturbation bounds for continuous-time Markov chains
نویسندگان
چکیده
منابع مشابه
Continuous-Time Markov Chains and Applications: A Singular Perturbation Approach
Feel lonely? What about reading books? Book is one of the greatest friends to accompany while in your lonely time. When you have no friends and activities somewhere and sometimes, reading book can be a great choice. This is not only for spending the time, it will increase the knowledge. Of course the b=benefits to take will relate to what kind of book that you are reading. And now, we will conc...
متن کاملDiscrete Time Markov Chains : Ergodicity Theory
Lecture 8: Discrete Time Markov Chains: Ergodicity Theory Announcements: 1. We handed out HW2 solutions and your homeworks in Friday’s recitation. I am handing out a few extras today. Please make sure you get these! 2. Remember that I now have office hours both: Wednesday at 3 p.m. and Thursday at 4 p.m. Please show up and ask questions about the lecture notes, not just the homework! No one cam...
متن کاملOccupancy distributions in Markov chains via Doeblin's ergodicity coefficient
We state and prove new properties about Doeblin’s ergodicity coefficient for finite Markov chains. We show that this coefficient satisfies a sub-multiplicative type inequality (analogous to the Markov-Dobrushin’s ergodicity coefficient), and provide a novel but elementary proof of Doeblin’s characterization of weak-ergodicity for non-homogeneous chains. Using Doeblin’s coefficient, we illustrat...
متن کاملStrong Stability and Perturbation Bounds for Discrete Markov Chains
We consider the stability problem of discrete Markov chains when their transition matrices are perturbed. For finite irreducible Markov chains many perturbation bounds for the stationary vector are available. In this paper, we identify a condition under which these bounds are carried over to discrete irreducible Markov chains which are not finite.
متن کاملContinuous Time Markov Chains
Discrete-time Markov chains are useful in simulation, since updating algorithms are easier to construct in discrete steps. They can also be useful as crude models of physical, biological, and social processes. However, in the physical and biological worlds time runs continuously, and so discrete-time mathematical models are not always appropriate. This is especially true in population biology –...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Inequalities & Applications
سال: 2005
ISSN: 1331-4343
DOI: 10.7153/mia-08-15