Orthant probabilities and the attainment of maxima on a vertex of a simplex
classification
🧮 math.PR
math.FAmath.MG
keywords
boundsorthantprobabilitiessimplexvertexattainmentattainscalculate
read the original abstract
We calculate bounds for orthant probabilities for the equicorrelated multivariate normal distribution and use these bounds to show the following: for degree $k>4$, the probability that a $k$-homogeneous polynomial in $n$ variables attains a relative maximum on a vertex of the $n$-dimensional simplex tends to one as the dimension $n$ grows. The bounds we obtain for the orthant probabilities are tight up to $\log(n)$ factors.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.