Lorenz ordering of means and medians
✍ Scribed by Barry C. Arnold; Jose A. Villaseñor
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 214 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The asymptotic distribution of \(k\) th nearest neighbor regression and autoregression estimates (local means) is obtained for \(\alpha\)-mixing processes. Local medians, as considered by Truong and Stone (1991, Ann. Statist. 20 77-97), are also shown to be asymptotically normally distributed. 1995
## Abstract For each vertex __u__ in a connected graph __H__, the __distance__ of __u__ is the sum of the distances from __u__ to each of the vertices __v__ of __H.__ A vertex of minimum distance in __H__ is called a __median__ vertex. It is shown that for any graph __G__ there exists a graph __H__
Let Xi, X,, ..., X, denote a random sample from an unknown symmetric population distribution with mean, 0. The observations aresubject to right censorship. The parameter, 8, is estimated using the Kap1a.n-Meier median and various trimmed mean estimators (at a = 2, .3, and .4). A comparison is made b
This paper studies the simultaneous selection of extreme populations from a set of independent populations. Two types of subset selection rules for k populations are proposed and studied. The first type selects one subset of populations that should contain the population with the smallest, and anoth