Article contents
Analyticity of iterates of random non-expansive maps
Published online by Cambridge University Press: 01 July 2016
Abstract
This paper focuses on the analyticity of the limiting behavior of a class of dynamical systems defined by iteration of non-expansive random operators. The analyticity is understood with respect to the parameters which govern the law of the operators. The proofs are based on contraction with respect to certain projective semi-norms. Several examples are considered, including Lyapunov exponents associated with products of random matrices both in the conventional algebra, and in the (max, +) semi-field, and Lyapunov exponents associated with non-linear dynamical systems arising in stochastic control. For the class of reducible operators (defined in the paper), we also address the issue of analyticity of the expectation of functionals of the limiting behavior, and connect this with contraction properties with respect to the supremum norm. We give several applications to queueing theory.
Keywords
- Type
- General Applied Probability
- Information
- Copyright
- Copyright © Applied Probability Trust 2000
Footnotes
The work of FB was supported in part by the TMR grant ALAPEDES (‘The Algebraic Approach to Performance Evaluation of Discrete Event System’, RB-FMRX-CT-96-0074).
References
- 2
- Cited by