The least variable phase type distribution is erlang
Open accessThe DOI matches its Crossref record.
Abstract
Let Xt, t ≥ 0 be any continuous-time Markov process on states 0,1, …, n where Xo = n and To is the time to reach 0 which is absorbing. We prove that To is most nearly constant in the sense of minimizing the coefficient of variation var(T0)/(ET0)2 over all transition matrices Pij and exponential delay parameters λi- in each state when Pii = 1, i = n, n - l,…, 1 and λi, ≡ constant. The latter chain is Erlang's process on n fictitious states and has been used to show that an arbitrary semi-Markov process can be approximated by a Markov process. It has been a long-open problem since the work of Kendall, Cox, and others to try to improve on Erlang's scheme by generalizing the transition structure of X, i.e. adding loops, twists, and turns in order to make the overall waiting time have smaller coefficient of variation. We destroy this hope by showing at last that Erlang's original method is not improvable. Our proof is simple and elegant and is a nice example of the power of martingales; it seems intractible without them.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Methods in Statistical Kinetics
Moffitt, J. R., Chemla, Y. R., & Bustamante, C. (2010) · Methods in Enzymology · doi:10.1016/s0076-6879(10)75010-2 · Cited by 66
A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions
Osogami, T., & Harchol-Balter, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45232-4_13 · Cited by 55
“By contrast, an n-phase Erlang distribution has only two free parameters and is also known to have the least normalized second moment among all the n-phase PH distributions [1].”
Background
Metadata
- Authors
- David, A., & Larry, S.
- Venue
- Communications in Statistics. Stochastic Models
- Publisher
- Informa UK Limited
- Published
- 1987-01
- Volume
- 3
- Issue
- 3
- Pages
- 467-473
- ISSN
- 0882-0287 (ISSN-L)
- OpenAlex
- W1993834778
- Cited by
- 185
- References
- 0
- FWCI
- 2.43
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The least variable phase type distribution is erlang. https://app.cochat.ai/papers/10.1080/15326348708807067
- The paper
- David, A., & Larry, S. (1987). The least variable phase type distribution is erlang. Communications in Statistics. Stochastic Models. https://doi.org/10.1080/15326348708807067
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.