C
Colm Art O'Cinneide
Researcher at Purdue University
Publications - 36
Citations - 1111
Colm Art O'Cinneide is an academic researcher from Purdue University. The author has contributed to research in topics: Markov chain & Phase-type distribution. The author has an hindex of 16, co-authored 36 publications receiving 1060 citations. Previous affiliations of Colm Art O'Cinneide include University of Arizona & University of Arkansas.
Papers
More filters
Journal ArticleDOI
Characterization of phase-type distributions
TL;DR: In this article, the authors proved that a distribution with rational Laplace-Stieltjes transform is phase-type if and only if it is either the point mass at zero, or it has a continuous positive density on the positive reals and its Laplace StisJes transform has a unique pole of maximal real part (which is therefore real).
Journal ArticleDOI
Phase-type distributions: open problems and a few properties
TL;DR: In this article, the authors describe some conjectures concerning phase-type Markov chains and offer some partial proofs and other evidence in support of the conjectures, including the geometry of the set of phases and the properties of their densities.
Journal ArticleDOI
On non-uniqueness of representations of phase-type distributions
TL;DR: In this article, the authors introduce two properties which are useful in addressing the question of non-uniqueness of representations of phase-type distributions, and discuss their interrelationship, and relate them to some known results on mixtures of convolutions of exponential distributions.
Journal ArticleDOI
The M/M /∞ queue in a random environment
Colm Art O'Cinneide,P. Purdue +1 more
TL;DR: The M/M/oo queue in a random environment is an infinite-server queue where arrival and service rates are stochastic processes and the steady-state behavior of such a system is studied in this article.
Journal ArticleDOI
Entrywise perturbation theory and error analysis for Markov chains
TL;DR: This paper proves that Grassmann, Taksar, and Heyman's algorithm for computing the steady-state vector of a Markov chain is stable, and that the problem itself is well-conditioned, in the sense of entrywise relative error.