On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks

DOI10.1287/moor.1060.0247zbMath1278.90090arXivmath/0204268OpenAlexW2088141907MaRDI QIDQ5388028

David Gamarnik

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0204268

zbMATH Keywords

undecidabilityLyapunov functionspositive recurrence

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Related Items (2)

Light tail asymptotics in multidimensional reflecting processes for queueing networks ⋮ On deciding stability of multiclass queueing networks under buffer priority scheduling policies

This page was built for publication: On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks