Stationary solutions of stochastic recursions describing discrete event systems
Recursions of the form \(x_{n+1}=\varphi _n[x_n]\), where \(\{\varphi_n, n\geq 0\}\) is a stationary ergodic sequence of maps from a Polish space (\(E,\mathcal E\)) into itself and \(\{x_n, n\geq 0\}\) are random variables taking values in (\(E,\mathcal E\)), often describe discrete event systems subject to random influences. In recursions of practical interest, the stability conditions are usually derived and existence, uniqueness and convergence are proved only under simplifying assumptions about \(\{\varphi _n\}_n\), or on the nature of these maps. As these assumptions are typically not met in practice, a solution concept known from the theory of stochastic differential equations is proposed. A pathwise solution is replaced by the construction of a probability measure on another sample space and of families of random variables on this space whose law gives a stationary solution to the examined recursion. The existence of a stationary solution is then translated into the tightness of a sequence of probability distributions. The relations to similar approaches in problems of random dynamical systems, stationary queueing systems and communication systems are mentioned. The construction of a probability measure on the selected space is described and a proposal is presented on how tightness implies stationarity. Further, a theorem on uniqueness is given along lines familiar from the ergodic theory of positive Markov operators on spaces of continuum functions. The proposed technique is illustrated by the reinterpretation of well-known solutions in simple queueing systems and by proving uniqueness of some of them. Its ability is shown to prove existence of solutions in non-monotonic recursions of the type \(x_{n+1}=\varphi _n(x_n,\xi _n)\), where \(\{\xi _n, n\geq 0\}\) is a stationary and ergodic sequence of random variables and \(\varphi \) is a deterministic function.
- A correction and some additional remarks on: Stationary solutions of stochastic recursions describing discrete event systems
- A generalized backward scheme for solving nonmonotonic stochastic recursions
- Stationarity of measure-valued stochastic recursions: Applications to the pure delay system and the SRPT queue
- scientific article; zbMATH DE number 194401
- An invariant distribution for the G/G/1 queueing operator
- Ergodic theorems. With a supplement by Antoine Brunel
- scientific article; zbMATH DE number 3664138 (Why is no real title available?)
- scientific article; zbMATH DE number 19532 (Why is no real title available?)
- scientific article; zbMATH DE number 50996 (Why is no real title available?)
- scientific article; zbMATH DE number 1460450 (Why is no real title available?)
- scientific article; zbMATH DE number 941166 (Why is no real title available?)
- scientific article; zbMATH DE number 3998137 (Why is no real title available?)
- scientific article; zbMATH DE number 4121067 (Why is no real title available?)
- scientific article; zbMATH DE number 3245885 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3322728 (Why is no real title available?)
- On the cut-off phenomenon in some queueing systems
- On the Ergodicity and Stability of the Sequence $w_{n + 1} = f(w_n ,\xi _n )$: Applications to Communication Networks
- Some ergodic results on stochastic iterative discrete events systems
- A correction and some additional remarks on: Stationary solutions of stochastic recursions describing discrete event systems
- Stability in distribution of randomly perturbed quadratic maps as Markov processes
- Coupling in the queue with impatience: case of several servers
- A generalized backward scheme for solving nonmonotonic stochastic recursions
- The queue with impatience: construction of the stationary workload under FIFO
- On stability of queueing networks with job deadlines
- Non-causal strictly stationary solutions of random recurrence equations
- Existence and uniqueness of a stationary and ergodic solution to stochastic recurrence equations via Matkowski's FPT
- Piecewise linear concave dynamical systems appearing in the microscopic traffic modeling
This page was built for publication: Stationary solutions of stochastic recursions describing discrete event systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275925)
