to marvin rosenblum, with best wishes on the occasion of his retirement Several extensions of Loewner's theory of monotone operator functions are given. These include a theorem on boundary interpolation for matrix-valued functions in the generalized Nevanlinna class. The theory of monotone operator
Some Extensions of Tukey's Depth Function
β Scribed by Jian Zhang
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 210 KB
- Volume
- 82
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
β¦ Synopsis
As the extensions of Tukey's depth, a family of affine invariant depth functions are introduced for multivariate location and dispersion. The location depth functions can be used for the purpose of multivariate ordering. Such kind ordering can retain more information from the original data than that based on Tukey's depth. The dispersion depth functions provide some additional view of the dispersion of the data set. It is shown that these sample depth functions converge to their population versions uniformly on any compact subset of the parameter space. The deepest points of these depth functions are affine equivariant estimates of multivariate location and dispersion. Under some general conditions these estimates are proved to have asymptotic breakdown points at least 1/3 and convergence rates of 1/`n. Their asymptotic distributions are also obtained under some regularity conditions. A new algorithm based on the idea of thresholding is presented for computing these kinds of estimates and realized in the bivariate case. Simulations indicate that some of them could have the empirical mean squared errors smaller than those based on Tukey's depth function or Donoho's depth function.
π SIMILAR VOLUMES
The sensitivity of halfspace depth values and contours to perturbations of the underlying distribution is investigated. The influence function of the halfspace depth of any point x # R p is bounded and discontinuous; it is constant and positive when the perturbing observation z is placed in any opti
We consider that thealgorithm of numerical taxonomy focused upon the concept of "homogeneity", proposed by BIJSEB and BABONI-URBANI (1982) for binary data, satisfies beat from all the other algorithms known by us, the conditions of claeeification in biology formulated by BECKNEB in 1959. Therefore
We bring together ideas in analysis on Hopf f-algebra actions on II 1 subfactors of finite Jones index [9,24] and algebraic characterizations of Frobenius, Galois and cleft Hopf extensions [3,13,14] to prove a non-commutative algebraic analogue of the classical theorem: a finite degree field extensi