Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 79 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 35 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 231 tok/s Pro
GPT OSS 120B 471 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Pointwise estimates for first passage times of perpetuity sequences (1512.03449v2)

Published 10 Dec 2015 in math.PR

Abstract: We consider first passage times $\tau_u = \inf{n:\; Y_n>u}$ for the perpetuity sequence $$ Y_n = B_1 + A_1 B_2 + \cdots + (A_1\ldots A_{n-1})B_n, $$ where $(A_n,B_n)$ are i.i.d. random variables with values in ${\mathbb R} +\times {\mathbb R}$. Recently, a number of limit theorems related to $\tau_u$ were proved including the law of large numbers, the central limit theorem and large deviations theorems. We obtain a precise asymptotics of the sequence ${\mathbb P}[\tau_u = \log u/\rho ]$, $\rho >0$, $u\to \infty $ which considerably improves the previous results. There, probabilities ${\mathbb P}[\tau_u \in I_u]$ were identified, for some large intervals $I_u$ around $k_u$, with lengths growing at least as $\log\log u$. Remarkable analogies and differences to random walks are discussed.

Summary

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube