Functional equations with multiple recursive terms

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
124 Downloads (Pure)

Abstract

In this paper, we study a functional equation for generating functions of the form
f(z) = g(z) ∑i=1,...,M  pf(α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 languageEnglish
Pages (from-to)7-23
Number of pages17
JournalQueueing Systems
Volume102
Issue number1-2
Early online date4 Sept 2022
DOIs
Publication statusPublished - Oct 2022

Keywords

  • Generating function
  • Laplace–Stieltjes transform
  • Queueing model
  • Recursion
  • Stochastic process

Fingerprint

Dive into the research topics of 'Functional equations with multiple recursive terms'. Together they form a unique fingerprint.

Cite this