Abstract
Let X=(X1,X2) be a two-dimensional random variable and X(n), n∈N, a sequence of i.i.d. copies of X. The associated random walk is S(n)=X(1)+⋯+X(n). The corresponding absorbed-reflected walk W(n), n∈N, in the first quadrant is given by W(0)=x∈R+2 and W(n)=max{0,W(n−1)−X(n)}, where the maximum is taken coordinate-wise. This is often called the Lindley process and models the waiting times in a two-server queue. We characterize recurrence of this process, assuming suitable, rather mild moment conditions on X. It turns out that this is directly related with the tail asymptotics of the exit time of the random walk x+S(n) from the quadrant, so that the main part of this paper is devoted to an analysis of that exit time in relation with the drift vector, that is, the expectation of X.
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.