Related papers: Almost sure bounds for a weighted Steinhaus random…
We determine the order of magnitude of $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q}$ up to factors of size $e^{O(q^2)}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, for all real $1 \leq q \leq \frac{c\log x}{\log\log…
Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…
Algorithmic stability is a classical approach to understanding and analysis of the generalization error of learning algorithms. A notable weakness of most stability-based generalization bounds is that they hold only in expectation.…
Statistically self-similar measures on $[0,1]$ are limit of multiplicative cascades of random weights distributed on the $b$-adic subintervals of $[0,1]$. These weights are i.i.d, positive, and of expectation $1/b$. We extend these cascades…
We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…
The objective of the paper is to establish a computable upper bound for the almost sure convergence rate for a class of ratio consensus algorithms defined via column-stochastic matrices. Our result extends the works of Iutzeler et al.…
By the continuous mapping theorem, if a sequence of $d$-dimensional random vectors $(\mathbf{W}_n)_{n\geq1}$ converges in distribution to a multivariate normal random variable $\Sigma^{1/2}\mathbf{Z}$, then the sequence of random variables…
We prove new upper bounds for a spectral exponential sum by refining the process by which one evaluates mean values of $L$-functions multiplied by an oscillating function. In particular, we introduce a method which is capable of taking into…
Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…
The lower and upper bounds are found for the leading term of summatory totient function $\sum_{k\leq N}k^u\phi^v(k)$ in various ranges of $u\in{\mathbb R}$ and $v\in{\mathbb Z}$.
We provide a sufficient condition for the bounded law of the iterated logarithms for strictly stationary random fields expressable as a functional of i.i.d. random fields when the summation is done on rectangles. The study is done via the…
We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…
We establish upper bounds for moments of zeta sums using results on shifted moments of the Riemann zeta function under the Riemann hypothesis.
We introduce a general class $F_0$ of additive functions $f$ such that $f(p) = 1$ and prove a tight bound for exponential sums of the form $\sum_{n \le x} f(n) e(\alpha n)$ where $f \in F_0$ and $e(\theta) = \exp(2\pi i \theta)$. Both…
New bounds for the $k$-th order derivatives of the solutions of the normal and multivariate normal Stein equations are obtained. Our general order bounds involve fewer derivatives of the test function than those in the existing literature.…
We find a nontrivial upper bound on the average value of the function M(n) which associates to every positive integer n the minimal Hamming weight of a multiple of n. Some new results about the equation M(n)=M(n') are given.
We study the problem of bounding the posterior distribution of discrete probabilistic programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in this setting: even if exact Bayesian inference is possible,…
Let $\lambda$ the Barban--Vehov weights, defined in $(1)$. Let $X\ge z_1\ge100$ and $z_2=z_1^\tau$ for some $\tau>1$. We prove that \begin{equation*} \sum_{n\le X}\frac{1}{n}\Bigl(\sum_{\substack{d|n}}\lambda_d\Bigr)^2 \le f(\tau)\frac{\log…
We obtain a tight, up to a logarithmic factor, upper bound on the number of solutions to the equation $$ \sum_{j=1}^n a_j \frac{s_j}{r_j} =a_0, \qquad $$ with variables $r_1,...,r_n$ in an arbitrary box at the origin and variables $s_1,...,…
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…