English
Related papers

Related papers: Strong Converse Inequalities for Bernstein Polynom…

200 papers

We find approximate expressions x(k,n) and y(k,n) for the real and imaginary parts of the kth zero z_k=x_k+i y_k of the Bessel polynomial y_n(x). To obtain these closed-form formulas we use the fact that the points of well-defined curves in…

Mathematical Physics · Physics 2011-05-06 Rafael G. Campos , Marisol L. Calderon

In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…

Information Theory · Computer Science 2016-09-28 Masahito Hayashi , Shun Watanabe

We find two-sides estimates for the best uniform approximations of classes of convolutions of $2\pi$-periodic functions from unit ball of the space $L_p, 1 \le p <\infty,$ with fixed kernels, modules of Fourier coefficients of which satisfy…

Classical Analysis and ODEs · Mathematics 2020-08-05 A. S. Serdyuk , I. V. Sokolenko

Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…

Classical Analysis and ODEs · Mathematics 2025-07-04 T. M. Dunster

Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…

Probability · Mathematics 2016-08-11 V. Yu. Korolev , A. V. Dorofeeva

We present precise multilevel exponential concentration inequalities for polynomials in Ising models satisfying the Dobrushin condition. The estimates have the same form as two-sided tail estimates for polynomials in Gaussian variables due…

Probability · Mathematics 2019-06-18 Radosław Adamczak , Michał Kotowski , Bartłomiej Polaczyk , Michał Strzelecki

We derive simple concentration inequalities for bounded random vectors, which generalize Hoeffding's inequalities for bounded scalar random variables. As applications, we apply the general results to multinomial and Dirichlet distributions…

Probability · Mathematics 2013-11-05 Xinjia Chen

We derive a non-asymptotic expression for the moments of traces of monomials in several independent complex Wishart matrices, extending some explicit formulas available in the literature. We then deduce the explicit expression for the…

Probability · Mathematics 2008-08-30 Wlodek Bryc

In this paper, we develop a non-asymptotic local normal approximation for multinomial probabilities. First, we use it to find non-asymptotic total variation bounds between the measures induced by uniformly jittered multinomials and the…

Statistics Theory · Mathematics 2023-09-06 Eric Bax , Frédéric Ouimet

We prove invariance theorems for general inequalities of different metrics and apply them to limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities with the polyharmonic operator for…

Classical Analysis and ODEs · Mathematics 2020-02-27 Michael I. Ganzburg

We study strong (pathwise) approximation of Cox-Ingersoll-Ross processes. We propose a Milstein-type scheme that is suitably truncated close to zero, where the diffusion coefficient fails to be locally Lipschitz continuous. For this scheme…

Numerical Analysis · Mathematics 2016-08-02 Mario Hefter , André Herzwurm

We discuss isoperimetric inequalities for convex sets. These include the classical isoperimetric inequality and that of Brunn-Minkowski, Blaschke-Santalo, Busemann-Petty and their various extensions. We show that many such inequalities…

Metric Geometry · Mathematics 2016-07-05 Grigoris Paouris , Peter Pivovarov

This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…

Number Theory · Mathematics 2016-10-10 Khristo N. Boyadzhiev

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

Classical Analysis and ODEs · Mathematics 2016-02-10 Omran Kouba

A new type of combinations of Bernstein operators is given in [1]. Here, we introduce another one, which can be used to approximate the functions with singularities. The direct and inverse results of the weighted approximation of this new…

Functional Analysis · Mathematics 2011-06-28 Wen-ming Lu , Lin Zhang

The Conway-Maxwell-Poisson distribution is a two-parameter generalisation of the Poisson distribution that can be used to model data that is under- or over-dispersed relative to the Poisson distribution. The normalizing constant…

Statistics Theory · Mathematics 2019-04-05 Robert E. Gaunt , Satish Iyengar , Adri B. Olde Daalhuis , Burcin Simsek

Method of parameterizing and smoothing the unknown underling distributions using Bernstein polynomials is proposed, verified and investigated. Any distribution with bounded and smooth enough density can be approximated by the proposed…

Methodology · Statistics 2015-06-23 Zhong Guan

Strong asymptotics of polynomials orthogonal on the unit circle with respect to a weight of the form $$ W(z) = w(z) \prod_{k=1}^m |z-a_k|^{2\beta_k}, \quad |z|=1, \quad |a_k|=1, \quad \beta_k>-1/2, \quad k=1, ..., m, $$ where $w(z)>0$ for…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. Martinez-Finkelshtein , K. T. -R. McLaughlin , E. B. Saff

In this paper, we discuss asymptotic relations for the approximation of $\left\vert x\right\vert ^{\alpha},\alpha>0$ in $L_{\infty}\left[ -1,1\right] $ by Lagrange interpolation polynomials based on the zeros of the Chebyshev polynomials of…

Classical Analysis and ODEs · Mathematics 2018-01-17 Michael Revers

The paper presents exponentially-strong converses for source-coding, channel coding, and hypothesis testing problems. More specifically, it presents alternative proofs for the well-known exponentially-strong converse bounds for almost…

Information Theory · Computer Science 2023-01-18 Mustapha Hamad , Michele Wigger , Mireille Sarkiss