Abstract
Let {Φn} be a Markov chain on the state space [0, ∞) that is stochastically ordered in its initial state; that is, a stochastically larger initial state produces a stochastically larger chain at all other times. Examples of such chains include random walks, the number of customers in various queueing systems, and a plethora of storage processes. A large body of recent literature concentrates on establishing geometric ergodicity of {Φn} in total variation; that is, proving the existence of a limiting probability measure π and a number r > 1 such that [Formula: see text] for every deterministic initial state Φ0 ≡ x. We seek to identity the largest r that satisfies this relationship. A dependent sample path coupling and a Foster-Lyapunov drift inequality are used to derive convergence rate bounds; we then show that the bounds obtained are frequently the best possible. Application of the methods to queues and random walks are included.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.