Hostname: page-component-848d4c4894-p2v8j Total loading time: 0.001 Render date: 2024-05-21T06:33:25.915Z Has data issue: false hasContentIssue false
  • English
  • Français

Analyticity of iterates of random non-expansive maps

Part of: Genetics and population dynamics Probability theory on algebraic and topological structures Nonlinear operators and their properties Real functions: Miscellaneous topics Analytic continuation Stability theory

Published online by Cambridge University Press:  01 July 2016

François Baccelli  and
Dohy Hong
François Baccelli*
Affiliation:
ENS Paris
Dohy Hong*
Affiliation:
ENS Paris
*
∗ Postal address: ENS, DMI-LIENS, 45 rue d'Ulm, 75230 Paris Cedex 05, France.
∗∗ Email address: francois.baccelli@ens.fr
Get access Rights & Permissions [Opens in a new window]

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

Contractionnon-expansivenessanalyticityvectorial recurrence relationLyapunov exponentsasymptotic mean value

MSC classification

Primary: 47H09: Contraction-type mappings, nonexpansive mappings, $A$-proper mappings, etc. 32D05: Domains of holomorphy 60B99: None of the above, but in this section 34D05: Asymptotic properties
Secondary: 26E05: Real-analytic functions 47H40: Random operators 34D08: Characteristic and Lyapunov exponents
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 32 , Issue 1 , March 2000 , pp. 193 - 220
Copyright
Copyright © Applied Probability Trust 2000 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

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

[1] Baccelli, F. and Hong, D. (1998). Analytic Expansions of (max, +) Lyapunov Exponents. INRIA Rept, May, 3427, INRIA Sophia-Antipolis. Submitted to Ann. Appl. Prob.Google Scholar
[2] Baccelli, F., Hasenfuss, S. and Schmidt, V. (1999). Differentiability of Functionals of Poisson Processes via Coupling. Stoch. Proc. Appl. 81, 299–321.Google Scholar
[3] Baccelli, F., Cohen, G., Olsder, G. J. and Quadrat, J. P. (1992). Synchronization and Linearity. John Wiley, New York.Google Scholar
[4] Bhattacharya, R. N. and Lee, O. (1988). Ergodicity and central limit theorems for a class of Markov processes. J. Multivar. Anal. 27, 80–90.Google Scholar
[5] Błaszczyszyn, B., (1995). Factorial moment expansion for stochastic systems. Stoch. Proc. Appl. 56, 321–335.Google Scholar
[6] Borovkov, A. A. (1992). On ergodicity of iterations of random Lipschitz transformations. Russ. Acad. Sci., Dokl. Math. 45, 551–555.Google Scholar
[7] Borovkov, A. A. (1998). Ergodicity and Stability of Stochastic Processes. John Wiley, New York.Google Scholar
[8] Cohen, J. E. (1988). Subadditivity, generalized product of random matrices and operations research. SIAM Rev. 30, 69–86.CrossRefGoogle Scholar
[9] Cohen, G., Gaubert, S. and Quadrat, J. P. (1995). Asymptotic throughput of continuous timed Petri nets. In Proc. 34th Conf. on Decision and Control. New Orleans, pp. 2029–2034.Google Scholar
[10] Crandall, M. and Tartar, L. (1980). Some relations between nonexpansive and order preserving mappings. Proc. AMS 78, 385–390.Google Scholar
[11] Diaconis, P. and Freedman, D. (1998). Iterated random functions. { Preprint}. Available at http://www.stat. Berkeley.EDU/users/freedman/511.ps.Z.Google Scholar
[12] Gaubert, S. and Gunawardena, J. (1998). A non-linear hierarchy for discrete event dynamical systems, In Proc. IEE Wodes 98, Cagliari, Italy.Google Scholar
[13] Gunawardena, J. (ed.) (1998). Idempotency. Cambridge University Press.Google Scholar
[14] Jean-Marie, A. (1997). The waiting time distribution in Poisson-driven deterministic systems. INRIA Rept, Jan 7, 3083, INRIA Sophia-Antipolis.Google Scholar
[15] Jean-Marie, A. (1998). Note on the convergence of Taylor expansions for E W. Working paper, INRIA Sophia-Antipolis.Google Scholar
[16] Mairesse, J. (1997). Products of irreducible random matrices in the (max, +) algebra. Adv. Appl. Prob. 29, 444–477.Google Scholar
[17] Neveu, J. (1970). Bases mathématiques du calcul des probabilités. Masson, Paris.Google Scholar
[18] Peres, Y. (1991). Analytic dependence of Lyapunov exponents on transition probability. In Proc. Oberwolfach Conf., ed. Arnold, L. (Lecture Notes in Math. 1486). Springer, Berlin, pp. 64–80.Google Scholar
[19] Peres, Y. (1992). Domain of analytic continuation of the top Lyapunov exponent. Ann. IHP 28, 131–148.Google Scholar
[20] Reiman, M. I. and Simon, B. (1989). Open queueing systems in light traffic. Math. Operat. Res. 14, 26–59.Google Scholar
[21] Ross, S. M. (1983). Introduction to stochastic dynamic programming. In Probability and Mathematical Statistics. Academic Press, New York.Google Scholar
[22] Ruelle, D. (1979). Analyticity properties of the characteristic exponents of random matrix products. Adv. Math. 32, 68–80.Google Scholar
[23] Takacs, L. (1962). Introduction to the Theory of Queues. Oxford University Press, Oxford.Google Scholar
[24] Titchmarsh, E. C. (1939). The Theory of Functions, 2nd edn. Oxford University Press, Oxford.Google Scholar
[25] Vincent, J. M. (1990). Stability condition of a service system with precedence constraints between the tasks. Perf. Eval. 12, 61–66.Google Scholar
[26] Zazanis, M. A. (1992). Analyticity of Poisson-driven stochastic systems. Adv. Appl. Prob. 24, 532–541.Google Scholar