Identifiability of Mixtures

Abstract

Let F(x, 0) be a family of distribution functions indexed by If G(0) is a distribution function on 12, H(x) = fQF(x, 0) dG(B) is a mixture with respect to G. If there is a unique G yielding H, the mixture is said to be identifiable. This paper summarises some known results related to identifiability of special types of mixtures and then discusses the general problem of identifiability in terms of mappings. Some new results follow for mappings with special features. © 1982, Australian Mathematical Society. All rights reserved.