Paper detail

Persistence of autoregressive sequences with logarithmic tails

We consider autoregressive sequences $X_n=aX_{n-1}+ξ_n$ and $M_n=\max\{aM_{n-1},ξ_n\}$ with a constant $a\in(0,1)$ and with positive, independent and identically distributed innovations $\{ξ_k\}$. It is known that if $\mathbf P(ξ_1>x)\sim\frac{d}{\log x}$ with some $d\in(0,-\log a)$ then the chains $\{X_n\}$ and $\{M_n\}$ are null recurrent. We investigate the tail behaviour of recurrence times in this case of logarithmically decaying tails. More precisely, we show that the tails of recurrence times are regularly varying of index $-1-d/\log a$. We also prove limit theorems for $\{X_n\}$ and $\{M_n\}$ conditioned to stay over a fixed level $x_0$. Furthermore, we study tail asymptotics for recurrence times of $\{X_n\}$ and $\{M_n\}$ in the case when these chains are positive recurrent and the tail of $\logξ_1$ is subexponential.

preprint2022arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.