English
Related papers

Related papers: Random linear recursions with dependent coefficien…

200 papers

We study a linear recursion with random Markov-dependent coefficients. In a "regular variation in, regular variation out" setup we show that its stationary solution has a multivariate regularly varying distribution. This extends results…

Probability · Mathematics 2010-06-15 D. Hay , R. Rastegar , A. Roitershtein

For a class of stationary Markov-dependent sequences $(A_n,B_n)\in\mathbb{R}^2,$ we consider the random linear recursion $S_n=A_n+B_nS_{n-1},$ $n\in\mathbb{Z},$ and show that the distribution tail of its stationary solution has a power law…

Probability · Mathematics 2007-05-23 Alexander Roitershtein

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)…

Probability · Mathematics 2013-04-08 Gerold Alsmeyer , Sebastian Mentemeier

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…

Probability · Mathematics 2010-02-08 Paweł Hitczenko , Jacek Wesołowski

Consider the linear nonhomogeneous fixed point equation R =_d sum_{i=1}^N C_i R_i + Q, where (Q,N,C_1,...,C_N) is a random vector with N in{0,1,2,3,...}U{infty}, {C_i}_{i=1}^N >= 0, P(|Q|>0) > 0, and {R_i}_{i=1}^N is a sequence of i.i.d.…

Probability · Mathematics 2011-08-19 Mariana Olvera-Cravioto

In this paper we show under weak assumptions that for $R\stackrel{d}{=}1+M_1+M_1M_2+\ldots$, where $P(M\in[0,1])=1$ and $M_i$ are independent copies of $M$, we have $\ln P(R>x)\sim C\, x\ln P(M>1-\frac1x)$ as $x\to\infty$. The constant $C$…

Probability · Mathematics 2017-05-29 Bartosz Kolodziejek

We consider the following recurrence relation with random i.i.d. coefficients $(a_n,b_n)$: $$ x_{n+1}=a_{n+1} x_n+b_{n+1} $$ where $a_n\in GL(d,\mathbb{R}),b_n\in \mathbb{R}^d$. Under natural conditions on $(a_n,b_n)$ this equation has a…

Probability · Mathematics 2007-05-23 Yves Guivarc'h

Given a sequence $(M_{n},Q_{n})_{n\ge 1}$ of i.i.d.\ random variables with generic copy $(M,Q) \in GL(d, \R) \times \R^d$, we consider the random difference equation (RDE) $$ R_{n}=M_{n}R_{n-1}+Q_{n}, $$ $n\ge 1$, and assume the existence…

Probability · Mathematics 2013-04-04 Ewa Damek , Sebastian Mentemeier , Mariusz Mirek , Jacek Zienkiewicz

We consider the random variables $R$ which are solutions of the distributional equation $R\overset{\cL}{=}MR+Q$, where $(Q,M)$ is independent of $R$ and $\ABS{M}\leq 1$. Goldie and Gr\"ubel showed that the tails of $R$ are no heavier than…

Probability · Mathematics 2009-12-23 Jean-Baptiste Bardet , Hélène Guerin , Florent Malrieu

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…

Probability · Mathematics 2007-05-23 Claudia Kluppelberg , Serguei Pergamenchtchikov

Consider a sequence of i.i.d. random Lipschitz functions $\{\Psi_n\}_{n \geq 0}$. Using this sequence we can define a Markov chain via the recursive formula $R_{n+1} = \Psi_{n+1}(R_n)$. It is a well known fact that under some mild moment…

Probability · Mathematics 2015-04-21 Piotr Dyszewski

Let $N > 1$ be a fixed integer and $(C_1,..., C_N,Q)$ a random element of $GL(d, \R)^N x \R^d$. We consider solutions of multivariate smoothing transforms, i.e. random variables $R$ satisfying $$R \eqdist \sum_{i=1}^N C_i R_i +Q $$ where…

Probability · Mathematics 2013-04-04 Dariusz Buraczewski , Ewa Damek , Sebastian Mentemeier , Mariusz Mirek

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 linear recursion of the form $$R^{(k+1)}\stackrel{\mathcal D}{=}\sum_{i=1}^{N}C_iR^{(k)}_i+Q,$$ where $(Q,N,C_1,C_2,\dots)$ is a real-valued random vector with $N\in\mathbb{N}=\{0, 1, 2, \dots\}$,…

Probability · Mathematics 2015-04-01 Ningyuan Chen , Mariana Olvera-Cravioto

We study invertibility of matrices of the form $D+R$ where $D$ is an arbitrary symmetric deterministic matrix, and $R$ is a symmetric random matrix whose independent entries have continuous distributions with bounded densities. We show that…

Probability · Mathematics 2015-06-02 Brendan Farrell , Roman Vershynin

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…

Probability · Mathematics 2018-02-15 Søren Asmussen , Sergey Foss

We consider a sequence of random variables $(R_n)$ defined by the recurrence $R_n=Q_n+M_nR_{n-1}$, $n\ge1$, where $R_0$ is arbitrary and $(Q_n,M_n)$, $n\ge1$, are i.i.d. copies of a two-dimensional random vector $(Q,M)$, and $(Q_n,M_n)$ is…

Statistics Theory · Mathematics 2011-07-15 Paweł Hitczenko , Jacek Wesołowski

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

The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…

Dynamical Systems · Mathematics 2015-06-10 Cristian Ghiu , Raluca Tuliga , Constantin Udriste

We study the extremes of a sequence of random variables $(R_n)$ defined by the recurrence $R_n=M_nR_{n-1}+q$, $n\ge1$, where $R_0$ is arbitrary, $(M_n)$ are iid copies of a non--degenerate random variable $M$, $0\le M\le1$, and $q>0$ is a…

Probability · Mathematics 2011-06-22 Pawel Hitczenko
‹ Prev 1 2 3 10 Next ›