Related papers: Almost sure bounds for a weighted Steinhaus random…

In this article we establish exponential moment bounds, moment bounds in fractional order smoothness spaces, a uniform H\"older continuity in time, and strong convergence rates for a class of fully discrete exponential Euler-type numerical…

Lower and upper bounds are explored for the uniform (Kolmogorov) and $L^2$-distances between the distributions of weighted sums of dependent summands and the normal law. The results are illustrated for several classes of random variables…

We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…

The best bounds of the form $B(\alpha,\beta,\gamma,x)=(\alpha+\sqrt{\beta^2+\gamma^2 x^2})/x$ for ratios of modified Bessel functions are characterized: if $\alpha$, $\beta$ and $\gamma$ are chosen in such a way that…

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as "Birch sums". Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the…

In this short note we derive, for bounded domains, an upper bound for a Friedrichs type constant in a weighted Friedrichs type inequality. This upper bound generalizes a well known upper bound of the Friedrichs constant. This upper bound is…

This paper presents a novel systematic methodology to obtain new simple and tight approximations, lower bounds, and upper bounds for the Gaussian Q-function, and functions thereof, in the form of a weighted sum of exponential functions.…

For fast computation of the Arnold complexity of length $2^{n}$ binary words we obtain an upper bound for the Shannon function $Sh(n)$

The zero bias distribution $W^*$ of $W$, defined though the characterizing equation $\mathit{EW}f(W)=\sigma^2Ef'(W^*)$ for all smooth functions $f$, exists for all $W$ with mean zero and finite variance $\sigma^2$. For $W$ and $W^*$ defined…

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

This paper considers a probabilistic model for floating-point computation in which the roundoff errors are represented by bounded random variables with mean zero. Using this model, a probabilistic bound is derived for the forward error of…

We improve the previuosly known bound for some vertex Folkman numbers.

We study a weighted divisor function $\mathop{{\sum}'}\limits_{mn\leq x}\cos(2\pi m\theta_1)\sin(2\pi n\theta_2)$, where $\theta_i (0<\theta_i<1)$ is a rational number. By connecting it with the divisor problem with congruence conditions,…

Bivariate partial-sums discrete probability distributions are defined. The question of the existence of a limit distribution for iterated partial summations is solved for finite-support bivariate distributions which satisfy conditions under…

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

The likelihood function of a finite mixture model is a non-convex function with multiple local maxima and commonly used iterative algorithms such as EM will converge to different solutions depending on initial conditions. In this paper we…

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

We use Stein's method to obtain explicit bounds on the rate of convergence for the Laplace approximation of two different sums of independent random variables; one being a random sum of mean zero random variables and the other being a…

This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is…