2010
DOI: 10.1016/j.spl.2010.06.013
|View full text |Cite
|
Sign up to set email alerts
|

Random linear recursions with dependent coefficients

Abstract: a b s t r a c tWe consider the equation R n = Q n + M n R n−1 , with random non-i.i.d. coefficients (Q n , M n ) n∈Z ∈ R 2 , and show that the distribution tails of the stationary solution to this equation are regularly varying at infinity.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
24
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 10 publications
(25 citation statements)
references
References 33 publications
1
24
0
Order By: Relevance
“…The proof combines ideas developed in [20,41,18]. We notice that Grey conjectured in [20] that using his method it may be possible to extend the results of [41] and rid of the assumption that (Q n ) n∈Z and (M n ) n∈Z are independent.…”
Section: Resultsmentioning
confidence: 90%
See 2 more Smart Citations
“…The proof combines ideas developed in [20,41,18]. We notice that Grey conjectured in [20] that using his method it may be possible to extend the results of [41] and rid of the assumption that (Q n ) n∈Z and (M n ) n∈Z are independent.…”
Section: Resultsmentioning
confidence: 90%
“…The next lemma, which generalizes Proposition 2.1 of [18], is the key element of our proof of Theorem 1.…”
Section: Appendix Proof Of Theoremmentioning
confidence: 88%
See 1 more Smart Citation
“…The degeneracy condition (16) In the iid-case, degeneracy occurs when P(Ac + B = c) = 1 for some c ∈ R and takes a side note only to deal with. This is quite different in the presence of a Markovian environment, and this subsection therefore collects some relevant facts about the degeneracy condition (16) and particularly shows its equivalence with (17). To avoid trivialities, we assume |S| > 1 throughout.…”
Section: If Condition (18) Failsmentioning
confidence: 99%
“…and this forces c i to be unique. (b) Turning to (16), pick any i, j ∈ S such that p ij > 0. Then P i (E n ) > 0 for all n ≥ 1, where…”
Section: If Condition (18) Failsmentioning
confidence: 99%