Related papers: Implicit renewal theory in the arithmetic case
Consider distributional fixed point equations of the form R =d f(C_i, R_i, 1 <= i <= N), where f(.) is a possibly random real valued function, N in {0, 1, 2, 3,...} U {infty}, {C_i}_{i=1}^N are real valued random weights and {R_i}_{i >= 1}…
We extend Goldie's (1991) Implicit Renewal Theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power tail asymptotics of the distributions of the solutions R to: R =_D…
We study the tail behavior of Markov-modulated generalized Ornstein-Uhlenbeck processes -- that is, solutions to Langevin-type stochastic differential equations driven by a background continuous-time Markov chain. To this end, we consider a…
We study solutions to the stochastic fixed point equation $X\stackrel{d}{=}AX+B$ when the coefficients are nonnegative and $B$ is an "inverse exponential decay" (IED) random variable. We provide theorems on the left tail of $X$ which…
This paper presents precise large deviation estimates for solutions to stochastic fixed point equations of the type V =_d f(V), where f(v) = Av + g(v) for a random function g(v) = o(v) a.s. as v tends to infinity. Specifically, we provide…
We consider solutions to so-called stochastic fixed point equation $R \stackrel{d}{=} \Psi(R)$, where $\Psi $ is a random Lipschitz function and $R$ is a random variable independent of $\Psi$. Under the assumption that $\Psi$ can be…
We study the situations when the solution to a weighted stochastic recursion has a power law tail. To this end, we develop two complementary approaches, the first one extends Goldie's (1991) implicit renewal theorem to cover recursions on…
This work investigates the tail behavior of solutions to the affine stochastic fixed-point equation of the form $X\stackrel{d}{=}AX+B$, where $X$ and $(A,B)$ are independent. Focusing on the light-tail regime, following [Burdzy et al.…
Given a sequence $(M_{n},Q_{n})_{n\ge 1}$ of i.i.d. random variables with generic copy $(M,Q)$ such that $M$ is a regular $d\times d$ matrix and $Q$ takes values in $\mathbb{R}^{d}$, we consider the random difference equation (RDE)…
We investigate a stationary random coefficient autoregressive process. Using renewal type arguments tailor-made for such processes, we show that the stationary distribution has a power-law tail. When the model is normal, we show that the…
Given a sequence of i.i.d. random functions $\Psi_{n}:\mathbb{R}\to\mathbb{R}$, $n\in\mathbb{N}$, we consider the iterated function system and Markov chain which is recursively defined by $X_{0}^{x}:=x$ and…
Consider the perpetuity equation $X \stackrel{\mathcal{D}}{=} A X + B$, where $(A,B)$ and $X$ on the right-hand side are independent. The Kesten--Grincevi\v{c}ius--Goldie theorem states that $P \{ X > x \} \sim c x^{-\kappa}$ if $E A^\kappa…
We prove several forms of renewal theorem tailored to renewal processes with marks and clusters. In particular, for an i.i.d. sequence $(\xi_i,X_i)_{i \geq 0}$, where $\xi_0$ denotes a finite point process on $\mathbb{R}$ and $X_0$ denotes…
We study the affine recursion $X_n = A_nX_{n-1}+B_n$ where $(A_n,B_n)\in {\mathbb R}^+ \times {\mathbb R} $ is an i.i.d. sequence and recursions $X_n = \Phi_n(X_{n-1})$ defined by Lipschitz transformations such that $\Phi (x)\geq Ax+B$. It…
We consider a fixed-point equation for a non-negative integer-valued random variable, that appears in branching processes with state-independent immigration. A similar equation appears in the analysis of a single-server queue with a…
We consider random vectors $X$ that satisfy the equation in law $X=AX+B$, where $A$ is a given random diagonal matrix and $B$ a given random vector, both independent of $X$. It is well known by the works of Kesten and Goldie that the…
Tail asymptotics of the solution $R$ to a fixpoint problem of type $R =_{st} Q + \sum_1^N R_m$ is derived under heavy-tailed conditions allowing both dependence between $Q$ and $N$ and the tails to be of the same order of magnitude. Similar…
We establish an upper bound on the tails of a random variable that arises as a solution of a stochastic difference equation. In the non--negative case our bound is similar to a lower bound obtained by Goldie and Gr\"ubel in 1996.
We consider the tail behavior of random variables $R$ which are solutions of the distributional equation $R\stackrel{d}{=}Q+MR$, where $(Q,M)$ is independent of $R$ and $|M|\le 1$. Goldie and Gr\"{u}bel showed that the tails of $R$ are no…
This article introduces a non-parametric information-theoretic approach to inference about the tail of a continuous or a discrete distribution. Leveraging a new concept named tail profile -- a set of information-theoretic quantities…