A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms

DOI10.1287/opre.36.1.137zbMath0655.65150OpenAlexW2006642748MaRDI QIDQ3802575

L. K. Platzman, Jane C. Ammons, John J. III Bartholdi

Publication date: 1988

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.36.1.137

zbMATH Keywords

tail probabilitynumerical examplesNP-hard problem{\#}P-hardtransform inversion formula

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Probabilistic methods, stochastic differential equations (65C99)

Related Items (7)

A comparison of three random disciplines ⋮ Queue length distributions from probability generating functions via discrete Fourier transforms ⋮ Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach ⋮ Transient and busy period analysis of the GI/G/1 queue: The method of stages ⋮ The Fourier-series method for inverting transforms of probability distributions ⋮ Stochastic models of space priority mechanisms with Markovian arrival processes ⋮ Performance analysis of an ISDN switch with distributed architecture: Circuit switched calls

This page was built for publication: A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms