English
Related papers

Related papers: Iterated Random Functions and Slowly Varying Tails

200 papers

Let $\Psi_1,\Psi_2,...$ be a sequence of i.i.d. random Lipschitz functions on a complete separable metric space with unbounded metric $d$ and forward iterations $X_n$. Suppose that $X_n$ has a stationary distribution. We study the…

Probability · Mathematics 2015-08-28 Gerold Alsmeyer

We consider a Markov chain on $R^+$ with asymptotically zero drift and finite second moments of jumps which is positive recurrent. A power-like asymptotic behaviour of the invariant tail distribution is proven; such a heavy-tailed invariant…

Probability · Mathematics 2012-08-16 Denis Denisov , Dmitry Korshunov , Vitali Wachtel

The extremes of a univariate Markov chain with regulary varying stationary marginal distribution and asymptotically linear behavior are known to exhibit a multiplicative random walk structure called the tail chain. In this paper, we extend…

Probability · Mathematics 2014-02-04 Anja Janßen , Johan Segers

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…

Probability · Mathematics 2017-06-14 Ewa Damek , Piotr Dyszewski

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…

Probability · Mathematics 2021-10-07 Gerold Alsmeyer , Sara Brofferio , Dariusz Buraczewski

We study the stochastic recursion $X_n=\Psi_n(X_{n-1})$, where $(\Psi_n)_{n\geq 1}$ is a sequence of i.i.d. random Lipschitz mappings close to the random affine transformation $x\mapsto Ax+B$. We describe the tail behaviour of the…

Probability · Mathematics 2020-12-16 Ewa Damek , Bartosz Kołodziejek

We consider a stochastic recurrence equation of the form $Z_{n+1} = A_{n+1} Z_n+B_{n+1}$, where $\mathbb{E}[\log A_1]<0$, $\mathbb{E}[\log^+ B_1]<\infty$ and $\{(A_n,B_n)\}_{n\in\mathbb{N}}$ is an i.i.d. sequence of positive random vectors.…

Probability · Mathematics 2016-09-13 Bohan Chen , Chang-Han Rhee , Bert Zwart

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…

Probability · Mathematics 2026-01-15 Gerold Alsmeyer , Anita Behme

At high levels, the asymptotic distribution of a stationary, regularly varying Markov chain is conveniently given by its tail process. The latter takes the form of a geometric random walk, the increment distribution depending on the sign of…

Methodology · Statistics 2014-12-11 Holger Drees , Johan Segers , Michał Warchoł

For a stochastic difference equation $D_n=A_nD_{n-1}+B_n$ which stabilises upon time we study tail distribution asymptotics of $D_n$ under the assumption that the distribution of $\log(1+|A_1|+|B_1|)$ is heavy-tailed, that is, all its…

Probability · Mathematics 2020-07-28 Dmitry Korshunov

An asymptotic model for extreme behavior of certain Markov chains is the "tail chain". Generally taking the form of a multiplicative random walk, it is useful in deriving extremal characteristics such as point process limits. We place this…

Probability · Mathematics 2011-12-30 Sidney I. Resnick , David Zeber

The upper extremes of a Markov chain with regulary varying stationary marginal distribution are known to exhibit under general conditions a multiplicative random walk structure called the tail chain. More generally, if the Markov chain is…

Probability · Mathematics 2007-06-13 Johan Segers

We prove tail estimates for variables $\sum_i f(X_i)$, where $(X_i)_i$ is the trajectory of a random walk on an undirected graph (or, equivalently, a reversible Markov chain). The estimates are in terms of the maximum of the function $f$,…

Probability · Mathematics 2007-12-25 Roy Wagner

This article concerns the tail probabilities of a light-tailed Markov-modulated L\'evy process stopped at a state-dependent Poisson rate. The tails are shown to decay exponentially at rates given by the unique positive and negative roots of…

Probability · Mathematics 2021-10-26 Brendan K. Beare , Won-Ki Seo , Alexis Akira Toda

We provide a new extension of Breiman's Theorem on computing tail probabilities of a product of random variables to a multivariate setting. In particular, we give a complete characterization of regular variation on cones in $[0,\infty)^d$…

Probability · Mathematics 2020-06-09 Bikramjit Das , Vicky Fasen-Hartmann , Claudia Klüppelberg

Let $\Phi_n$ be an i.i.d. sequence of Lipschitz mappings of $\R^d$. We study the Markov chain $\{X_n^x\}_{n=0}^\infty$ on $\R^d$ defined by the recursion $X_n^x = \Phi_n(X^x_{n-1})$, $n\in\N$, $X_0^x=x\in\R^d$. We assume that…

Probability · Mathematics 2011-10-20 Dariusz Buraczewski , Ewa Damek , Mariusz Mirek

This paper studies the light-tailed asymptotics of the stationary tail probability vectors of a Markov chain of M/G/1 type. Almost all related studies have focused on the typical case, where the transition block matrices in the non-boundary…

Probability · Mathematics 2013-09-05 Tatsuaki Kimura , Kentaro Daikoku , Hiroyuki Masuyama , Yutaka Takahashi

This paper investigates tail asymptotics of stationary distributions and quasi-stationary distributions (QSDs) of continuous-time Markov chains on subsets of the non-negative integers. Based on the so-called flux-balance equation, we…

Probability · Mathematics 2023-08-16 Chuang Xu , Mads Christian Hansen , Carsten Wiuf

Let $X_{1},\ldots ,X_{n}$ be $n$ real-valued dependent random variables. With motivation from Mitra and Resnick (2009), we derive the tail asymptotic expansion for the weighted sum of order statistics $X_{1:n}\leq \cdots \leq X_{n:n}$ of…

Probability · Mathematics 2014-08-07 Enkelejd Hashorva , Jinzhi Li

Consider a random walk $S=(S_n:n\geq 0)$ that is ``perturbed'' by a stationary sequence $(\xi_n:n\geq 0)$ to produce the process $(S_n+\xi_n:n\geq0)$. This paper is concerned with computing the distribution of the all-time maximum…

Probability · Mathematics 2007-05-23 Victor F. Araman , Peter W. Glynn
‹ Prev 1 2 3 10 Next ›