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

From MaRDI portal
Publication:724723

DOI10.1016/J.JMAA.2018.06.049zbMATH Open1394.62038arXiv1804.02108OpenAlexW2796406035WikidataQ129649005 ScholiaQ129649005MaRDI QIDQ724723FDOQ724723


Authors: Frédéric Ouimet Edit this on Wikidata


Publication date: 26 July 2018

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1804.02108




Recommendations




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)