A generalized backward scheme for solving nonmonotonic stochastic recursions
From MaRDI portal
Publication:2341625
DOI10.1214/14-AAP1004zbMath1318.60038arXiv1009.1235OpenAlexW1969364317MaRDI QIDQ2341625
Publication date: 27 April 2015
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.1235
Stationary stochastic processes (60G10) Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random dynamical systems (37H99)
Related Items (3)
On the stability of a class of non-monotonic systems of parallel queues ⋮ Existence and uniqueness of a stationary and ergodic solution to stochastic recurrence equations via Matkowski’s FPT ⋮ Coupling in the queue with impatience: case of several servers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ergodicity and central limit theorems for a class of Markov processes
- Stationary solutions of stochastic recursions describing discrete event systems
- Two ergodicity criteria for stochastically recursive sequences
- Stochastically recursive sequences and their generalizations
- A non-increasing Lindley-type equation
- Single-server queues with impatient customers
- The queue with impatience: construction of the stationary workload under FIFO
- A method for solving a class of recursive stochastic equations
- Bounds and Approximations in Queuing through Monotonicity and Continuity
This page was built for publication: A generalized backward scheme for solving nonmonotonic stochastic recursions