Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case

Nico M. van Dijk; Karel Sladký

Kybernetika (2006)

  • Volume: 42, Issue: 1, page 37-56
  • ISSN: 0023-5954

Abstract

top
In two subsequent parts, Part I and II, monotonicity and comparison results will be studied, as generalization of the pure stochastic case, for arbitrary dynamic systems governed by nonnegative matrices. Part I covers the discrete-time and Part II the continuous-time case. The research has initially been motivated by a reliability application contained in Part II. In the present Part I it is shown that monotonicity and comparison results, as known for Markov chains, do carry over rather smoothly to the general nonnegative case for marginal, total and average reward structures. These results, though straightforward, are not only of theoretical interest by themselves, but also essential for the more practical continuous-time case in Part II (see [DijkSl2]). An instructive discrete-time random walk example is included.

How to cite

top

Dijk, Nico M. van, and Sladký, Karel. "Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case." Kybernetika 42.1 (2006): 37-56. <http://eudml.org/doc/33791>.

@article{Dijk2006,
abstract = {In two subsequent parts, Part I and II, monotonicity and comparison results will be studied, as generalization of the pure stochastic case, for arbitrary dynamic systems governed by nonnegative matrices. Part I covers the discrete-time and Part II the continuous-time case. The research has initially been motivated by a reliability application contained in Part II. In the present Part I it is shown that monotonicity and comparison results, as known for Markov chains, do carry over rather smoothly to the general nonnegative case for marginal, total and average reward structures. These results, though straightforward, are not only of theoretical interest by themselves, but also essential for the more practical continuous-time case in Part II (see [DijkSl2]). An instructive discrete-time random walk example is included.},
author = {Dijk, Nico M. van, Sladký, Karel},
journal = {Kybernetika},
keywords = {Markov chains; monotonicity; nonnegative matrices; Markov chains; monotonicity; nonnegative matrix},
language = {eng},
number = {1},
pages = {37-56},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case},
url = {http://eudml.org/doc/33791},
volume = {42},
year = {2006},
}

TY - JOUR
AU - Dijk, Nico M. van
AU - Sladký, Karel
TI - Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case
JO - Kybernetika
PY - 2006
PB - Institute of Information Theory and Automation AS CR
VL - 42
IS - 1
SP - 37
EP - 56
AB - In two subsequent parts, Part I and II, monotonicity and comparison results will be studied, as generalization of the pure stochastic case, for arbitrary dynamic systems governed by nonnegative matrices. Part I covers the discrete-time and Part II the continuous-time case. The research has initially been motivated by a reliability application contained in Part II. In the present Part I it is shown that monotonicity and comparison results, as known for Markov chains, do carry over rather smoothly to the general nonnegative case for marginal, total and average reward structures. These results, though straightforward, are not only of theoretical interest by themselves, but also essential for the more practical continuous-time case in Part II (see [DijkSl2]). An instructive discrete-time random walk example is included.
LA - eng
KW - Markov chains; monotonicity; nonnegative matrices; Markov chains; monotonicity; nonnegative matrix
UR - http://eudml.org/doc/33791
ER -

References

top
  1. Adan I. J. B. F., Wal J. van der, Monotonicity of the throughput in single server production and assembly networks with respect to buffer sizes, In: Queueing Networks with Blocking, North Holland, Amsterdam 1989, pp. 345–356 (1989) 
  2. Adan I. J. B. F., Wal J. van der, 10.1287/opre.37.6.953, Oper. Res. 37 (1989), 953–957 (1989) MR1069884DOI10.1287/opre.37.6.953
  3. Dijk N. M. van, Puterman M., 10.2307/1427271, Adv. in Appl. Probab. 20 (1988), 79–87 (1988) MR0932535DOI10.2307/1427271
  4. Dijk N. M. van, Wal J. van der, 10.1007/BF01150852, Queueing Systems 4 (1989), 1–16 (1989) DOI10.1007/BF01150852
  5. Dijk N. M. van, On the importance of bias-terms for error bounds and comparison results, In: Numerical Solution of Markov Chains (W. J. Stewart, ed.), Marcel Dekker, New York 1991, pp. 640–654 (1991) MR1142133
  6. Dijk N. M. van, Bounds and error bounds for queueing networks, Ann. Oper. Res. 36 (2003), 3027–3030 
  7. Dijk N. M. van, Queuing Networks and Product Forms, Wiley, New York 1993 MR1266845
  8. Dijk N. M. van, Sladký K., 10.1023/A:1021749829267, J. Optim. Theory Appl. 101 (1999), 449–474 (1999) MR1684679DOI10.1023/A:1021749829267
  9. Dijk N. M. van, Sladký K., Monotonicity and comparison results for nonnegative dynamic systems, Part II: Continuous-time case and reliability application. Kybernetika 42 (2006), No. 2 (to appear) 
  10. Dijk N. M. van, Taylor P. G., On strong stochastic comparison for steady state measures of Markov chains with a performability application, Oper. Res. 36 (2003), 3027–3030 
  11. Gross D., Miller D. R., 10.1287/opre.32.2.343, Oper. Res. 32 (1984), 343–361 (1984) MR0747747DOI10.1287/opre.32.2.343
  12. Keilson J., Kester A., 10.1016/0304-4149(77)90033-3, Stoch. Process. Appl. 5 (1977), 231–241 (1977) Zbl0367.60078MR0458596DOI10.1016/0304-4149(77)90033-3
  13. Massey W. A., 10.1287/moor.12.2.350, Math. Oper. Res. 12 (1987), 350–367 (1987) MR0888982DOI10.1287/moor.12.2.350
  14. Melamed B., Yadin N., 10.1287/opre.32.4.926, Oper. Res. 32 (1984), 926–943 (1984) Zbl0546.90038MR0865588DOI10.1287/opre.32.4.926
  15. Shantikumar J. G., Yao D. D., Monotonicity proporties in cyclic queueing networks with finite buffers, In: Queueing Networks with Blocking, North Holland, Amsterdam 1989, pp. 345–356 (1989) 
  16. Sladký K., Bounds on discrete dynamic programming recursions I, Kybernetika 16 (1980), 526–547 (1980) Zbl0454.90085MR0607292
  17. Stoyan D., Comparison Methods for Queues and Other Stochastic Models, Wiley, New York 1983 Zbl0536.60085MR0754339
  18. Tsoucas P., Walrand J., 10.2307/3214323, J. Appl. Probab. 26 (1989), 134–141 (1989) Zbl0673.60097MR0981258DOI10.2307/3214323
  19. Whitt W., 10.2307/1426475, Adv. in Appl. Probab. 13 (1981), 207–220 (1981) Zbl0449.60064MR0595895DOI10.2307/1426475
  20. Whitt W., 10.1287/moor.11.4.608, Math. Oper. Res. 11 (1986), 608–618 (1986) MR0865555DOI10.1287/moor.11.4.608

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.