Dispersive Ordering Results.
Abstract
A distribution F is less dispersed than a distribution G if 1/F(B)-1/F(A) < or = 1/G(A) for all 0 <A <B <1 (F < or = G). We generalize a characterization of dispersive ordering of Shaked (1982) J. Appl. Prob. concerning sign changes of F sub c - G, where F sub c is a translate of F. We then use this generalization plus total positivity to develop a simple proof of a characterization of dispersive distributions due to Lewis and Thompson (1981) J. Appl. Prob.; a distribution H is dispersive if F < or = G approaches H F < or = H G.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1983
- Accession Number
- ADA127587
Entities
People
- Frank Proschan
- James Lynch
Organizations
- Florida State University