Complete monotonicity of multinomial probabilities and its application to Bernstein estimators on the simplex

From MaRDI portal
(Redirected from Publication:724723)




Abstract: Let dinmathbbN and let gammaiin[0,infty), xiin(0,1) be such that sumi=1d+1gammai=Min(0,infty) and sumi=1d+1xi=1. We prove that �egin{equation*} a mapsto frac{Gamma(aM + 1)}{prod_{i=1}^{d+1} Gamma(a gamma_i + 1)} prod_{i=1}^{d+1} x_i^{agamma_i} end{equation*} is completely monotonic on (0,infty). This result generalizes the one found by Alzer (2018) for binomial probabilities (d=1). As a consequence of the log-convexity, we obtain some combinatorial inequalities for multinomial coefficients. We also show how the main result can be used to derive asymptotic formulas for quantities of interest in the context of statistical density estimation based on Bernstein polynomials on the d-dimensional simplex.



Cites work


Cited in
(20)






This page was built for publication: Complete monotonicity of multinomial probabilities and its application to Bernstein estimators on the simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724723)