Most likely paths to error when estimating the mean of a reflected random walk
Ken R. Duffy, Sean P. Meyn

TL;DR
This paper investigates the large deviation behavior of the mean position in a reflected random walk, revealing conditions under which simulation estimates tend to overestimate the true steady-state mean, impacting queueing system evaluations.
Contribution
It provides a detailed sample path large deviation analysis for RRWs, identifying the most likely paths leading to estimation errors and highlighting when naive simulation estimates are conservative.
Findings
Most likely paths involve the process being zero outside a specific interval.
When the rate function is coercive, overestimation of the mean is highly probable.
Results have significant implications for simulation-based performance evaluation of queueing systems.
Abstract
It is known that simulation of the mean position of a Reflected Random Walk (RRW) exhibits non-standard behavior, even for light-tailed increment distributions with negative drift. The Large Deviation Principle (LDP) holds for deviations below the mean, but for deviations at the usual speed above the mean the rate function is null. This paper takes a deeper look at this phenomenon. Conditional on a large sample mean, a complete sample path LDP analysis is obtained. Let denote the rate function for the one dimensional increment process. If is coercive, then given a large simulated mean position, under general conditions our results imply that the most likely asymptotic behavior, , of the paths is to be zero apart from on an interval and to satisfy the functional equation \begin{align*} \nabla…
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.
