Exact lower and upper bounds for shifts of Gaussian measures
نویسندگان
چکیده
Получены точные верхние и нижние грани для отношения $\operatorname{\mathbf E}w(\mathbf X-\mathbf v)/\operatorname{\mathbf X)$ центрированного гауссовского случайного вектора $\mathbf X$ в R^n$, а также оценки скорости изменения X-t\mathbf v)$ по отношению к $t$, где $w\colon\mathbf R^n\to[0,\infty)$ - произвольная одновершинная функция v$ произвольный вектор R^n$. В качестве следствия таких результатов даны функции мощности статистических критериев математического ожидания многомерного нормального распределения.
منابع مشابه
Upper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملupper and lower bounds for numerical radii of block shifts
for an n-by-n complex matrix a in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of a. in this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملExact upper and lower bounds on the misclassification probability
Abstract. A lower bound on the misclassification probability for a finite number of classes is obtained in terms of the total variation norms of the differences between the sub-distributions over the classes. This bound, which is shown to be exact in a certain rather strong sense, is based on an exact upper bound on the difference between the maximum and the mean of a finite set of real numbers...
متن کاملLower Bounds and Upper Bounds for MaxSAT
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is init...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ?????? ???????????? ? ?? ??????????
سال: 2022
ISSN: ['0040-361X', '2305-3151']
DOI: https://doi.org/10.4213/tvp5316