| Title:
|
Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case (English) |
| Author:
|
Dijk, Nico M. van |
| Author:
|
Sladký, Karel |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
42 |
| Issue:
|
1 |
| Year:
|
2006 |
| Pages:
|
37-56 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| Summary:
|
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. (English) |
| Keyword:
|
Markov chains |
| Keyword:
|
monotonicity |
| Keyword:
|
nonnegative matrices |
| MSC:
|
37N40 |
| MSC:
|
39A10 |
| MSC:
|
60J10 |
| MSC:
|
60J27 |
| MSC:
|
90A16 |
| MSC:
|
91B62 |
| idZBL:
|
Zbl 1249.60168 |
| idMR:
|
MR2208519 |
| . |
| Date available:
|
2009-09-24T20:13:50Z |
| Last updated:
|
2015-03-28 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/135698 |
| . |
| Related article:
|
http://dml.cz/handle/10338.dmlcz/135707 |
| . |
| Reference:
|
[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 |
| Reference:
|
[2] Adan I. J. B. F., Wal J. van der: Monotonicity of the throughput of a closed queueing network in the number of jobs.Oper. Res. 37 (1989), 953–957 MR 1069884, 10.1287/opre.37.6.953 |
| Reference:
|
[3] Dijk N. M. van, Puterman M.: Perturbation theory for Markov reward processes with applications to queueing systems.Adv. in Appl. Probab. 20 (1988), 79–87 MR 0932535, 10.2307/1427271 |
| Reference:
|
[4] Dijk N. M. van, Wal J. van der: Simple bounds and monotonicity results for multi-server exponential tandem queues.Queueing Systems 4 (1989), 1–16 10.1007/BF01150852 |
| Reference:
|
[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 MR 1142133 |
| Reference:
|
[6] Dijk N. M. van: Bounds and error bounds for queueing networks.Ann. Oper. Res. 36 (2003), 3027–3030 |
| Reference:
|
[7] Dijk N. M. van: Queuing Networks and Product Forms.Wiley, New York 1993 MR 1266845 |
| Reference:
|
[8] Dijk N. M. van, Sladký K.: Error bounds for dynamic nonnegative systems.J. Optim. Theory Appl. 101 (1999), 449–474 MR 1684679, 10.1023/A:1021749829267 |
| Reference:
|
[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) |
| Reference:
|
[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 |
| Reference:
|
[11] Gross D., Miller D. R.: The randomization technique as a modelling tool and solution procedure over discrete state Markov processes.Oper. Res. 32 (1984), 343–361 MR 0747747, 10.1287/opre.32.2.343 |
| Reference:
|
[12] Keilson J., Kester A.: Monotone matrices and monotone Markov processes.Stoch. Process. Appl. 5 (1977), 231–241 Zbl 0367.60078, MR 0458596, 10.1016/0304-4149(77)90033-3 |
| Reference:
|
[13] Massey W. A.: Stochastic ordering for Markov processes on partially ordered spaces.Math. Oper. Res. 12 (1987), 350–367 MR 0888982, 10.1287/moor.12.2.350 |
| Reference:
|
[14] Melamed B., Yadin N.: Randomization procedures in the computation of cumulative-time distributions over discrete state Markov processes.Oper. Res. 32 (1984), 926–943 Zbl 0546.90038, MR 0865588, 10.1287/opre.32.4.926 |
| Reference:
|
[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 |
| Reference:
|
[16] Sladký K.: Bounds on discrete dynamic programming recursions I.Kybernetika 16 (1980), 526–547 Zbl 0454.90085, MR 0607292 |
| Reference:
|
[17] Stoyan D.: Comparison Methods for Queues and Other Stochastic Models.Wiley, New York 1983 Zbl 0536.60085, MR 0754339 |
| Reference:
|
[18] Tsoucas P., Walrand J.: Monotonicity of throughput in non-Markovian networks.J. Appl. Probab. 26 (1989), 134–141 Zbl 0673.60097, MR 0981258, 10.2307/3214323 |
| Reference:
|
[19] Whitt W.: Comparing counting processes and queues.Adv. in Appl. Probab. 13 (1981), 207–220 Zbl 0449.60064, MR 0595895, 10.2307/1426475 |
| Reference:
|
[20] Whitt W.: Stochastic comparison for non-Markov processes.Math. Oper. Res. 11 (1986), 608–618 MR 0865555, 10.1287/moor.11.4.608 |
| . |
