2000 character limit reached
On the exit time from an orthant for badly oriented random walks
Published 21 Mar 2014 in math.PR | (1403.5540v2)
Abstract: In a paper, K. Raschel and R. Garbit proved that the exponential decreasing rate of the probability that a random walk (with all exponential moments) stays in a $d$-dimensional orthant is given by the minimum on this orthant of the Laplace transform of the random walk increments, as soon as this minimum exists. In other cases, the random walk is "badly oriented," and the exponential rate may depend on the starting point $x$. We prove here that this rate is nevertheless asymptotically equal to the infimum of the Laplace transform, as some selected coordinates of $x$ tend to infinity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.