Laplace Transform Inversion and Passage-Time Distributions in Markov Processes

@article{Harrison1990LaplaceTI,
  title={Laplace Transform Inversion and Passage-Time Distributions in Markov Processes},
  author={Peter G. Harrison},
  journal={Journal of Applied Probability},
  year={1990},
  volume={27},
  pages={74-87}
}
  • P. Harrison
  • Published 1 March 1990
  • Mathematics
  • Journal of Applied Probability
Products of the Laplace transforms of exponential distributions with different parameters are inverted to give a mixture of Erlang densities, i.e. an expression for the convolution of exponentials. The recurrence for the inversion of certain weighted sums of these transforms is then solved by converting it into a linear first-order partial differential equation. The result may be used to find the density function of passage times between states in a Markov process and it is applied to derive an… 
Passage time distributions in large Markov chains
TLDR
A load-balanced, distributed implementation is used to find the Laplace transform of the first passage time density and its derivatives at arbitrary values of the transform parameter s to derive the full passage time distribution from high-level modelling formalisms whose state spaces can be mapped onto finite Markov chains.
Approximating passage time distributions in queueing models by Bayesian expansion
  • G. Casale
  • Computer Science, Mathematics
    Perform. Evaluation
  • 2010
Fitting Convolutions of Exponential Distributions to Daily Realized Volatility Data
  • Shibin Zhang
  • Mathematics
    2010 Third International Conference on Information and Computing
  • 2010
Convolutions of exponential distributions have widely used in stochastic process and queuing network. In this paper, the closed-form of the probability density function of the sum of exponential
On the density for sums of independent exponential, Erlang and gamma variates
Abstract: This paper re-examines the density for sums of independent exponential, Erlang and gamma random variables. By using a divided difference perspective, the paper provides a unified approach
The Fourier-series method for inverting transforms of probability distributions
TLDR
This paper reviews the Fourier-series method for calculating cumulative distribution functions (cdf's) and probability mass functions (pmf's) by numerically inverting characteristic functions, Laplace transforms and generating functions and describes two methods for inverting Laplace transform based on the Post-Widder inversion formula.
Quantiles of Sojourn Times
TLDR
This paper reviews the various approaches taken to compute sojourn time quantiles in systems ranging from simple queues to arbitrary semiMarkov chains, by the authors and others, over the past twenty years and more.
Flowgraph Models for Generalized Phase Type Distributions Having Non‐Exponential Waiting Times
ABSTRACT. Aalen (1995) introduced phase type distributions based on Markov processes for modelling disease progression in survival analysis. For tractability and to maintain the Markov property,
Formulas for the distribution of sums of independent exponential random variables
  • M. Ulrey
  • Mathematics
    IEEE Trans. Reliab.
  • 2003
This paper derives a new type of formula for the probability that, among a collection of items with s-independent exponential times to failure, a certain subset of them fails in a given order before
Response Time Distributions in Queueing Network Models
  • P. Harrison
  • Mathematics
    Performance/SIGMETRICS Tutorials
  • 1993
TLDR
The class of Jackson networks that permit exact solution are analysed in both the open and closed cases, and approximation techniques for more general networks are proposed.
ML estimation of the parameters of a PH distribution in triangular canonical form
Distribution functions that can be expressed as exponential polynomials have gained a widespread acceptance in applied stochastic modeling. Mainly due to the non-uniqueness of the representation, the
...
...

References

SHOWING 1-10 OF 17 REFERENCES
A note on cycle times in tree-like queueing networks
  • P. Harrison
  • Mathematics
    Advances in Applied Probability
  • 1984
Cycle-time distribution is shown to take the form of a linear combination of M Erlang-N density functions in a cyclic queueing network of M servers and N customers. For paths of m servers in
An Enhanced Approximation by Pair-Wise Analysis of Servers for Time Delay Distributions in Queueing Networks
  • P. Harrison
  • Mathematics
    IEEE Transactions on Computers
  • 1986
TLDR
An approximation for the distribution of time delays experienced by a customer in a network of queues is presented and it is proved that the correlation between the sojourn times at successive servers on a customer's path in a closed queueing network with exponential servers is negative.
Closed Queuing Systems with Exponential Servers
TLDR
It is found that the distribution of customers in the closed queuing system is regulated by the stage or stages with the slowest effective service rate, which means that closed systems are shown to be stochastically equivalent to open systems in which the number of customers cannot exceed N.
Computational algorithms for closed queueing networks with exponential servers
TLDR
Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers based on two-dimensional iterative techniques which are highly efficient and quite simple to implement.
The Time for a Round Trip in a Cycle of Exponential Queues
TLDR
The present paper gives the generalization of Chow’s result (by means of a different proof) to the case of arbitrarily many exponential servers.
Sojourn times in closed queueing networks
This paper obtains the stationary joint distribution of a customer's sojourn times along an overtake-free path in a closed multiclass Jackson network. The distribution has a simple representation in
PASSAGE TIMES FOR OVERTAKE-FREE PATHS IN GORDON-NEWELL NETWORKS
Consider a path in a multiclass Gordon-Newell network such that a customer present in a node of this path cannot be overtaken by any other customer behind him in a node of this path or by
Regenerative Simulation of Response Times in Networks of Queues
TLDR
The marked job simulation via hitting times and the decomposition method are introduced, which simplifies the simulation of regenerative processes and improves the efficiency of simulation.
Brownian motion and stochastic flow systems
Brownian Motion. Stochastic Models of Buffered Flow. Further Analysis of Brownian Motion. Stochastic Calculus. Regulated Brownian Motion. Optimal Control of Brownain Motion. Optimizing Flow System
...
...