Implicit renewal theory and tails of solutions of random equations (Q758004)

From MaRDI portal
Revision as of 22:01, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Implicit renewal theory and tails of solutions of random equations
scientific article

    Statements

    Implicit renewal theory and tails of solutions of random equations (English)
    0 references
    0 references
    1991
    0 references
    Let \(\Psi\) be a random element of the space of Borel-measurable functions from \({\mathbb{R}}\) to \({\mathbb{R}}\). Let R be a random variable independent of \(\Psi\). The author treats the random equation \(R=\Psi \circ R\) where the equality denotes equality in probability law. After setting out this implicit renewal theory with corresponding rate results, more special equations are tackled. For example (i) \(\Psi (t)=Q+MT\), where Q and M are random and where a one-dimensional version of a result by \textit{H. Kesten} [Acta Math. 131, 207-248 (1973; Zbl 0291.60029)] receives a new and simpler treatment; (ii) \(\Psi (t)=Q+M \max (L,t)\), where \(M\geq 0\) a.s. and treated by \textit{G. Letac} [Random matrices and their applications, Proc. AMS-IMS-SIAM Joint Summer Res. Conf., Brunswick/Maine 1984, Contemp. Math. 50, 263-273 (1986; Zbl 0587.60057)]; (iii) \(\Psi (t)=\max (Q,Mt)\) with applications on the G/G/1-queue. Other examples are scattered throughout the paper. Proofs are gathered in a separate section, and show how classical renewal theory can be beautifully exploited to attack the more complicated implicit renewal theory. The paper ends with a discussion of the implications for extreme- value theory and an illustration from economics.
    0 references
    random equations
    0 references
    additive Markov process queues
    0 references
    renewal theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references