Hitting probabilities of constrained random walks representing tandem networks
Ali Devin Sezer

TL;DR
This paper develops approximation formulas for hitting probabilities of constrained random walks modeling tandem networks, with exponential decay of relative error, using harmonic systems and supermartingale constructions.
Contribution
It introduces a new approach to approximate hitting probabilities in high-dimensional tandem networks using harmonic systems and explicit formulas, with proven exponential error decay.
Findings
Derived approximation formulas for hitting probabilities.
Proved exponential decay of approximation error.
Provided explicit formulas based on harmonic systems.
Abstract
Let be the constrained random walk on , having increments , and with probabilities , , ,...,, where are the standard basis vectors. The process is assumed stable, i.e., for all Let be the first time the sum of the components of equals . We derive approximation formulas for the probability . For and a sequence of initial points we show that the relative error of the approximation decays exponentially in . The approximation formula is of the form where is the first time…
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.
Taxonomy
TopicsStochastic processes and statistical mechanics · Probability and Risk Models · Markov Chains and Monte Carlo Methods
