This work is concerned with nearly optimal controls of nonlinear dynamic systems under the influence of singularly perturbed Markov chains. The underlying Markov chains have fast and slow components and their states can be divided into a number of groups. Within each group of states, the chain varie
Singularly Perturbed Markov Chains: Convergence and Aggregation
β Scribed by G Yin; Q Zhang; G Badowski
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 215 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
β¦ Synopsis
Asymptotic properties of singularly perturbed Markov chains having measurable andΓor continuous generators are developed in this work. The Markov chain under consideration has a finite-state space and is allowed to be nonstationary. Its generator consists of a rapidly varying part and a slowly changing part. The primary concerns are on the properties of the probability vectors and an aggregated process that depend on the characteristics of the fast varying part of the generators. The fast changing part of the generators can either consist of l recurrent classes, or include also transient states in addition to the recurrent classes. The case of inclusion of transient states is examined in detail. Convergence of the probability vectors under the weak topology of L 2 is obtained first. Then under slightly stronger conditions, it is shown that the convergence also takes place pointwise. Moreover, convergence under the norm topology of L 2 is derived. Furthermore, a process with aggregated states is obtained which converges to a Markov chain in distribution.
π SIMILAR VOLUMES
This work is concerned with asymptotic properties of solutions to forward equations for singularly perturbed Markov chains with two small parameters. It is motivated by the model of a cost-minimizing firm involving production planning and capacity expansion and a two-level hierarchical decomposition
The marked increase in popularity of Bayesian methods in statistical practice over the last decade owes much to the simultaneous development of Markov chain Monte Carlo (MCMC) methods for the evaluation of requisite posterior distributions. However, along with this increase in computing power has co