Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

First-passage times over moving boundaries for asymptotically stable walks (1801.04136v1)

Published 12 Jan 2018 in math.PR

Abstract: Let ${S_n, n\geq1}$ be a random walk wih independent and identically distributed increments and let ${g_n,n\geq1}$ be a sequence of real numbers. Let $T_g$ denote the first time when $S_n$ leaves $(g_n,\infty)$. Assume that the random walk is oscillating and asymptotically stable, that is, there exists a sequence ${c_n,n\geq1}$ such that $S_n/c_n$ converges to a stable law. In this paper we determine the tail behaviour of $T_g$ for all oscillating asymptotically stable walks and all boundary sequences satisfying $g_n=o(c_n)$. Furthermore, we prove that the rescaled random walk conditioned to stay above the boundary up to time $n$ converges, as $n\to\infty$, towards the stable meander.

Summary

We haven't generated a summary for this paper yet.