Approximation of the Exit Probability of a Stable Markov Modulated Constrained Random Walk
Fatma Ba\c{s}o\u{g}lu Kabran, Ali Devin Sezer

TL;DR
This paper develops an approximation method for the exit probability of a stable Markov-modulated constrained random walk, with applications to tandem queue lengths, using harmonic functions derived from a characteristic surface.
Contribution
It introduces a novel approximation technique for exit probabilities of Markov-modulated random walks using characteristic surfaces and harmonic functions.
Findings
The approximation has exponentially vanishing relative error as the system size grows.
A characteristic matrix and surface are defined to analyze the process.
Harmonic functions based on eigenvectors are used for probability estimation.
Abstract
Let be the constrained random walk on having increments , , with jump probabilities , , and where is an irreducible aperiodic finite state Markov chain. The process represents the lengths of two tandem queues with arrival rate , and service rates , and . We assume that the average arrival rate with respect to the stationary measure of is less than the average service rates, i.e., is assumed stable. Let be the first time when the sum of the components of equals for the first time. Let be the random walk on having increments , , with probabilities , , and . Let be the first time the components of are equal. For $x \in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
