Computing stationary probability distributions and large deviation rates for constrained random walks. The undecidability results
| dc.creator | Gamarnik, David | |
| dc.date | 2002-04-22 | |
| dc.date.accessioned | 2026-07-07T04:47:59Z | |
| dc.date.available | 2026-07-07T04:47:59Z | |
| dc.description | Our model is a constrained homogeneous random walk in a nonnegative orthant Z_+^d. The convergence to stationarity for such a random walk can often be checked by constructing a Lyapunov function. The same Lyapunov function can also be used for computing approximately the stationary distribution of this random walk, using methods developed by Meyn and Tweedie. In this paper we show that, for this type of random walks, computing the stationary probability exactly is an undecidable problem: no algorithm can exist to achieve this task. We then prove that computing large deviation rates for this model is also an undecidable problem. We extend these results to a certain type of queueing systems. The implication of these results is that no useful formulas for computing stationary probabilities and large deviations rates can exist in these systems. | |
| dc.identifier | https://arxiv.org/abs/math/0204268 | |
| dc.identifier | http://arxiv.org/abs/math/0204268 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/63881 | |
| dc.subject | Probability | |
| dc.subject | 60G10;60G50;60J20;90B15;90B22 | |
| dc.title | Computing stationary probability distributions and large deviation rates for constrained random walks. The undecidability results | |
| dc.type | text |