Asymptotic analysis of tail probabilities based on the computation of moments (Q1916480)

From MaRDI portal
Revision as of 01:51, 20 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
Asymptotic analysis of tail probabilities based on the computation of moments
scientific article

    Statements

    Asymptotic analysis of tail probabilities based on the computation of moments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 July 1997
    0 references
    Moment-based algorithms for computing asymptotic parameters [cf. {G. L. Choudhury} and \textit{D. M. Lucantoni}, Numerical computation of large number of moments with applications to asymptotic analysis. In Proceedings of the International Teletraffic Congress Sponsored Seminar on Teletraffic Analysis Methods for Current and Future Telecom Networks, Bangalore, India 113-120 (1993)] are especially useful when the transforms are not available explicitly as in models of busy periods or polling systems. In this paper, the authors provide additional theoretical support for this moment-based algorithm for computing asymptotic parameters and new refined estimators for the case \(\beta\neq 0\). The new refined estimators converge much faster than the previous estimators.
    0 references
    tail probabilities
    0 references
    asymptotics analysis
    0 references
    moment generating functions
    0 references
    moment-based algorithms
    0 references
    asymptotic parameters
    0 references
    busy periods
    0 references
    polling systems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references