Papers
Topics
Authors
Recent
Search
2000 character limit reached

On decoupled standard random walks

Published 8 Feb 2024 in math.PR | (2402.05488v1)

Abstract: Let $S_{n}=\sum_{k=1}{n}\xi_{k}$, $n\in\mathbb{N}$, be a standard random walk with i.i.d. nonnegative increments $\xi_{1},\xi_{2},\ldots$ and associated renewal counting process $N(t)=\sum_{n\ge 1}1_{{S_{n}\le t}}$, $t\ge 0$. A decoupling of $(S_{n}){n\ge 1}$ is any sequence $\hat{S}{1}$, $\hat{S}{2},\ldots$ of independent random variables such that, for each $n\in\mathbb{N}$, $\hat{S}{n}$ and $S_{n}$ have the same law. Under the assumption that the law of $\hat{S}{1}$ belongs to the domain of attraction of a stable law with finite mean, we prove a functional limit theorem for the \emph{decoupled renewal counting process} $\hat{N}(t)=\sum{n\ge 1}1_{{\hat{S}{n}\le t}}$, $t\ge 0$, after proper scaling, centering and normalization. We also study the asymptotics of $\log \mathbb{P}{\min{n\ge 1}\hat{S}{n}>t}$ as $t\to\infty$ under varying assumptions on the law of $\hat{S}{1}$. In particular, we recover the assertions which were previously known in the case when $\hat{S}{1}$ has an exponential law. These results, which were formulated in terms of an infinite Ginibre point process, served as an initial motivation for the present work. Finally, we prove strong law of large numbers type results for the sequence of decoupled maxima $M{n}=\max_{1\le k\le n}\hat{S}{k}$, $n\in\mathbb{N}$, and the related first passage time process $\hat\tau(t)=\inf{n\in\mathbb{N}: M{n}>t}$, $t\ge 0$. In particular, we provide a tail condition on the law of $\hat{S}{1}$ in the case when the latter has finite mean but infinite variance that implies $\lim{t\to\infty}t{-1}\hat\tau(t)=\lim_{t\to\infty}t{-1}\mathbb{E}\hat\tau(t)=0$. In other words, $t{-1}\hat\tau(t)$ may exhibit a different limit behavior than $t{-1}\tau(t)$, where $\tau(t)$ denotes the level-$t$ first passage time of $(S_{n})_{n\ge 1}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.