Abstract
In this paper, we study a functional equation for generating functions of the form
f(z) = g(z) ∑i=1,...,M pi f(αi(z)) + K(z), viz. a recursion with multiple recursive terms. We derive and analyze the solution of this equation for the case that the αi(z) are commutative contraction mappings. The results are applied to a wide range of queueing, autoregressive and branching processes.
f(z) = g(z) ∑i=1,...,M pi f(αi(z)) + K(z), viz. a recursion with multiple recursive terms. We derive and analyze the solution of this equation for the case that the αi(z) are commutative contraction mappings. The results are applied to a wide range of queueing, autoregressive and branching processes.
Original language | English |
---|---|
Pages (from-to) | 7-23 |
Number of pages | 17 |
Journal | Queueing Systems |
Volume | 102 |
Issue number | 1-2 |
Early online date | 4 Sept 2022 |
DOIs | |
Publication status | Published - Oct 2022 |
Keywords
- Generating function
- Laplace–Stieltjes transform
- Queueing model
- Recursion
- Stochastic process