Linear dynamics for the state vector of Markov chain functions

Advances in Applied Probability

Volumn 36, Issue 4, 2004, Pages 1198-1211

  Ledoux, James ^a  

^a INSA DE RENNES   (France)

Author keywords

Lumpability; Proportional dynamics; Rogers Pitman matrix

Indexed keywords

MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; SET THEORY; VECTORS;

LUMPABILITY; PROPORTIONAL DYNAMICS; ROGERS-PITMAN MATRIX;

MARKOV PROCESSES;

EID: 13344284610     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1103662963     Document Type: Article

References (21)

1. Aoki, M. (1968). Control of large-scale dynamic systems by aggregation. IEEE Trans. Automatic Control 13, 246-253.
2. Berman, A. and Plemmons, R. J. (1979). Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York.
3. Buchholz, P. (1994). Exact and ordinary lumpability in finite Markov chains. J. Appl. Prob. 31, 59-75.
4. Cheung, R. C. (1980). A user-oriented software reliability model. IEEE Trans. Software Eng. 6, 118-125.
5. Coxson, P. G. (1984). Lumpability and observability of linear systems. J. Math. Anal. Appl. 99, 435-446.
6. Delebecque, F., Quadrat, J. P. and Kokotovic, P. V. (1984). A unified view of aggregation and coherency in networks and Markov chains, Internat. J. Control 40, 939-952.
7. Gross, D. and Miller, D. R. (1984). The randomization technique as a modeling tool and solution procedure for transient Markov processes. Operat. Res. 32, 343-361.
8. Jensen A. (1953). Markoff chains as an aid in the study of Markoff processes. Skand. Aktuarietidskr. 36, 87-91.
9. Kemeny, J. G. and Snell, J. L. (1976). Finite Markov Chains. Springer, New York.
10. Ledoux, J. (1997). A geometric invariant in weak lumpability of finite Markov chains. J. Appl. Prob. 34, 847-858.
11. Ledoux, J. and Rubino, G. (1997). Simple formulae for counting processes in reliability models. Adv. Appl. Prob. 29, 1018-1038.
12. Matheiss, T. H. and Rubin, D. S. (1980). A survey and comparison of methods for finding all vertices of convex polyhedral sets. Math. Operat. Res. 5, 167-185.
13. Nicola, V. F. (1989). Lumping in Markov reward processes. Res. Rep. 14719, IBM.
14. Nicola, V. F. (1995). Lumping in Markov reward processes. In Computations with Markov Chains, ed. W. J. Stewart, Kluwer, Boston, MA, pp. 663-666.
15. Poore, J. H., Mills, H. D. and Mutchler, D. (1993). Planning and certifying software system reliability. IEEE Software 10, 89-99.
16. Rogers, L. C. G. and Pitman, J. W. (1981). Markov functions. Ann. Prob. 9, 573-582.
17. Rubino, G. and Sericola, B. (1990). Closed-form solution for the distribution of the total time spent in a subset of states of a homogeneous Markov process during a finite observation period. J. Appl. Prob. 27, 713-719.
18. Rubino, G. and Sericola, B. (1991). A finite characterization of weak lumpable Markov processes. I. The discrete time case. Stoch. Process Appl. 38, 195-204.
19. Schweitzer, P. J. (1984). Aggregation methods for large Markov chains. In Mathematical Computer Performance and Reliability, eds G. Iazeolla et al., North-Holland, Amsterdam, pp. 275-286.
20. Sumita, U. and Rieders, M. (1989). Lumpability and time reversibility in the aggregation-disaggregation method for large Markov chains. Commun. Statist. Stoch. Models 5, 63-81.
21. Tsertsvadze, G. N. (1989). Aggregation of systems described by Markov chains. Automation Remote Control 5, 628-636.