First-passage times for random walks with nonidentically distributed increments (Q1621443)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | First-passage times for random walks with nonidentically distributed increments |
scientific article |
Statements
First-passage times for random walks with nonidentically distributed increments (English)
0 references
8 November 2018
0 references
Let \((S_n)_{n\in\mathbb{N}}\) be a random walk with independent, not necessarily identically distributed steps taking values on the real line. Assume that the random walk, properly normalized and rescaled, converges in distribution to a Brownian motion. For a deterministic sequence \((g_n)_{n\in\mathbb{N}}\), put \(T_g:=\inf\{n\in\mathbb{N}:S_n\leq g_n\}\). The main result of the paper gives the asymptotics of \(\mathbb{P}\{T_g>n\}\) as \(n\to\infty\) under a couple of additional assumptions. The asymptotic equivalent of \(\mathbb{P}\{T_g>n\}\) involves a slowly varying function denoted by \(U_g\). The authors find conditions under which \(\lim_{t\to\infty}U_g(t)\) exists and is finite. To prove the main result the authors work out a modification of the universality approach which is, roughly speaking, based on replacing random walks attracted to a Brownian motion with the Brownian motion itself. The aforementioned modification is achieved by exploiting an argument appealing directly to the functional central limit theorem for \((S_n)\) rather than the Komlós-Major-Tusnády coupling which is commonly used in this context. As a consequence of the result on the tail behavior the authors derive a functional limit theorem for \((S_n)_{n\in\mathbb{N}}\), again properly normalized and rescaled, conditionally on \(\{T_g>n\}\) as \(n\to\infty\). The assertions proved in the paper improve upon several earlier results available in the literature.
0 references
random walk
0 references
Brownian motion
0 references
first-passage time
0 references
overshoot
0 references
moving boundary
0 references
0 references
0 references
0 references
0 references