On invariant measures of stochastic recursions in a critical case

From MaRDI portal
Publication:2467603



Abstract: We consider an autoregressive model on mathbbR defined by the recurrence equation Xn=AnXn−1+Bn, where (Bn,An) are i.i.d. random variables valued in mathbbRimesmathbbR+ and mathbbE[logA1]=0 (critical case). It was proved by Babillot, Bougerol and Elie that there exists a unique invariant Radon measure of the process Xn. The aim of the paper is to investigate its behavior at infinity. We describe also stationary measures of two other stochastic recursions, including one arising in queuing theory.


The present paper is devoted to the study of the autoregressive model on \(\mathbb{R}\) described by the following recurrence equation: \[ X_n=A_nX_{n-1}+B_n, \] where \((B_n,A_n)\in \mathbb{R}\times \mathbb{R}^+\) are i.i.d. random variables according to a probability measure \(\mu\) and \(A_1\) satisfies the following condition: \(\mathbb{E}[A_1]=0\) (critical case). From another point of view, we may think of \((B_n,A_n)\) as a random element in the ``\(ax+b\) group and consider \(A_nX_{n-1}+B_n\) as the \((B_n,A_n)\)-image of \(X_{n-1}\). In [Ann. Probab. 25, No.~1, 478--493 (1997; Zbl 0873.60045)], \textit{M. Babillot, P. Bougerol} and \textit{L. Elie} showed that there exists a unique (up to a constant) invariant Radon measure \(\nu\) for the process \(\{X_n\}\) and that the following asymptotic estimate holds: for all positive \(\alpha,\beta\) one has \[ \nu((\alpha x,\beta x])\sim \log(\beta/\alpha)\cdot L^{\pm}(| x| ) \] as \(x\rightarrow \pm \infty\), where \(L^\pm\) are slowly varying functions. The main result in the paper under review is the following: if \(\mu\) is spread-out and has some moments, then the slowly varying functions are constant. To reach his goal, the author also derives results on a related Poisson equation and on the asymptotic behavior of its solutions. In the final section of the paper, the author consider two other random models. The first is of the form \(X'_n=B_n+A_n \max\{X_{n-1}',C_n\}\), and was introduced by [\textit{G. Letac}, A contraction principle for certain Markov chains and its applications. Random matrices and their applications, Proc. AMS-IMS-SIAM Joint Summer Res. Conf., Brunswick/Maine 1984, Contemp. Math. 50, 263--273 (1986; Zbl 0587.60057)]. The second is of the form \(X_n=\max\{A_n,X_{n-1},D_n\}\) and is widely studied in models for the waiting time in a single server queue.



Cites work









This page was built for publication: On invariant measures of stochastic recursions in a critical case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467603)