Related papers: On the concentration of certain additive functions

The concentration of empirical measures is studied for dependent data, whose joint distribution satisfies Poincar\'{e}-type or logarithmic Sobolev inequalities. The general concentration results are then applied to spectral empirical…

We investigate quantitative implications of the notion of log-concavity through a probabilistic interpretation. In particular, we derive concentration inequalities, moment and entropy bounds for random variables satisfying a precise degree…

We obtain exact for order estimates of best uniform approximations and uniform approximations by Fourier sums of classes of convolutions the periodic functions belong to unit balls of spaces $L_{p}, \ {1\leq p<\infty}$, with generating…

Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

For a given monic integral polynomial $f(x)$ of degree $n$, we define local roots $r_i$ of $f(x)$ for a completely decomposable prime $p$ by $r_i \in \mathbb{Z}$, $f(r_i) \equiv 0 \bmod p$ and $0 \le r_1 \le r_2 \le \dots \le r_n < p$. With…

The property of measure concentration is that an arbitrary 1-Lipschitz function $f:X\to \mathbb{R}$ on an mm-space $X$ is almost close to a constant function. In this paper, we prove that if such a concentration phenomenon arise, then any…

In this paper we show that if $A$ is a subset of the primes with positive relative density $\delta$, then $A+A$ must have positive upper density $C_1\delta e^{-C_2(\log(1/\delta))^{2/3}(\log\log(1/\delta))^{1/3}}$ in $\mathbb{N}$. Our…

We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower…

Let $P^-(n)$ denote the smallest prime factor of a natural integer $n>1$. Furthermore let $\mu$ and $\omega$ denote respectively the M\"obius function and the number of distinct prime factors function. We show that, given any set ${{\scr…

Concentration of distances in high dimension is an important factor for the development and design of stable and reliable data analysis algorithms. In this paper, we address the fundamental long-standing question about the concentration of…

We consider additive functionals of Markov processes in continuous time with general (metric) state spaces. We derive concentration bounds for their exponential moments and moments of finite order. Applications include diffusions,…

Let $f(n)$ count the number of subsets of $\{1,...,n\}$ without an element dividing another. In this paper I show that $f(n)$ grows like the $n$-th power of some real number, in the sense that $\lim_{n\rightarrow \infty}f(n)^{1/n}$ exists.…

The joint cumulative distribution function for order statistics arising from several different populations is given in terms of the distribution function of the populations. The computational cost of the formula in the case of two…

In this work we present concentration inequalities for the sum $S_n$ of independent integer-valued not necessary indentically distributed random variables, where each variable has tail function that can be bounded by some power function…

We establish concentration inequalities in the class of ultra log-concave distributions. In particular, we show that ultra log-concave distributions satisfy Poisson concentration bounds. As an application, we derive concentration bounds for…

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

Let $f: \mathbb{N} \to \mathbb{C}$ be a multiplicative function for which $$ \sum_{p : \, |f(p)| \neq 1} \frac{1}{p} = \infty. $$ We show under this condition alone that for any integer $h \neq 0$ the set $$ \{n \in \mathbb{N} : f(n) =…

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…