English
Related papers

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

200 papers

Inspired by the papers by Angelo and Xu, Q.J Math., 74, pp. 767-777, and improvements by Kerr and Klurman, arXiv:2211.05540, we study the probability that the weighted sums of a Rademacher random multiplicative function, $\sum_{n\leq…

Number Theory · Mathematics 2025-08-04 Marco Aymone

We show that if $f$ is the random completely multiplicative function, the probability that $\sum_{n\le x}\frac{f(n)}{n}$ is positive for every $x$ is at least $1-10^{-45}$, while also strictly smaller than $1$. For large $x$, we prove an…

Number Theory · Mathematics 2022-12-06 Rodrigo Angelo , Max Wenqiang Xu

We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are…

Probability · Mathematics 2012-09-11 Yuri Kifer

We give sufficient conditions for the bounded law of the iterated logarithms for strictly stationary random fields when the summation is done on rectangle. The study is done by the control of an appropriated maximal function. The case of…

Probability · Mathematics 2021-03-30 Davide Giraudo

We study two models of random multiplicative functions: Rademacher random multiplicative functions supported on the squarefree integers $f$, and Rademacher random completely multiplicative functions $f^*$. We prove that the partial sums…

Number Theory · Mathematics 2024-01-26 Marco Aymone

We prove that the $k$-th positive integer moment of partial sums of Steinhaus random multiplicative functions over the interval $(x, x+H]$ matches the corresponding Gaussian moment, as long as $H\ll x/(\log x)^{2k^2+2+o(1)}$ and $H$ tends…

Number Theory · Mathematics 2024-02-20 Mayank Pandey , Victor Y. Wang , Max Wenqiang Xu

We obtain strong invariance principles for normalized multiple iterated sums and integrals of the form $\bbS_N^{(\nu)}(t)=N^{-\nu/2}\sum_{0\leq k_1<...<k_\nu\leq Nt}\xi(k_1)\otimes\cdots\otimes\xi(k_\nu)$, $t\in[0,T]$ and…

Probability · Mathematics 2025-02-04 Yuri Kifer

In this paper, we obtain error bound for binomial and negative binomial approximations to weighted sums of locally dependent random variables, using Stein's method. We also discuss approximation results for weighted sums of independent…

Probability · Mathematics 2020-10-20 Amit N. Kumar

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

Number Theory · Mathematics 2026-03-09 Artyom Radomskii

We consider the sum of power weighted nearest neighbor distances in a sample of size n from a multivariate density f of possibly unbounded support. We give various criteria guaranteeing that this sum satisfies a law of large numbers for…

Probability · Mathematics 2009-11-03 Mathew D. Penrose , J. E. Yukich

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series with meromorphic continuation. Say we are given information on the poles of $A(s)$ with $|\Im s| \leq T$ for some large constant $T$. What is the best way to use such finite spectral data…

Number Theory · Mathematics 2025-11-19 Andrés Chirre , Harald Andrés Helfgott

Let $X$, $X_1$, $X_2$, $...$ be i.i.d. random variables, and let $S_n=X_1+... + X_n$ be the partial sums and $M_n=\max_{k\le n}|S_k|$ be the maximum partial sums. We give the sufficient and necessary conditions for a kind of limit theorems…

Probability · Mathematics 2007-05-23 Li-Xin Zhang

We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the…

Number Theory · Mathematics 2018-10-17 Olivier Bordellès , Lixia Dai , Randell Heyman , Hao Pan , Igor E. Shparlinski

In this paper, we establish an almost sure central limit theorem for a general random sequence under a strong approximation condition. Additionally, we derive the law of the iterated logarithm for the center of mass corresponding to a…

Probability · Mathematics 2024-07-08 Zhishui Hua , Wei Wanga , Liang Dong

We construct a $1$-bounded completely multiplicative function $f$ whose logarithmically-averaged partial sums satisfy $$ \limsup_{x \rightarrow \infty} \frac{\left|\sum_{n \leq x} \frac{f(n)}{n}\right|}{1+\exp\left(\sum_{p \leq x}…

Number Theory · Mathematics 2026-05-29 Alexander P. Mangerel

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

Number Theory · Mathematics 2013-09-09 Thai Hoang Le , Jeffrey D. Vaaler

In this paper we estimate the rest of the approximation of a stationary process by a martingale in terms of the projections of partial sums. Then, based on this estimate, we obtain almost sure approximation of partial sums by a martingale…

Probability · Mathematics 2011-05-05 Florence Merlevède , Costel Peligrad , Magda Peligrad

We prove that if $f$ is a random completely multiplicative function, conditional $f(p)=1$ for each prime $p \le (\log x)^{2-\epsilon}$, the probability that $\sum_{1\le n \le N}f(n)\ge 0$ for all $N\le x$ is $o(1)$ as $x \rightarrow…

Number Theory · Mathematics 2026-03-25 Rodrigo Angelo , Max Wenqiang Xu

We provide a simple proof that the partial sums $\sum_{n\leq x}f(n)$ of a Rademacher random multiplicative function $f$ change sign infinitely often as $x\to\infty$, almost surely.

Number Theory · Mathematics 2022-05-31 Marco Aymone , Winston Heap , Jing Zhao

We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.

Number Theory · Mathematics 2011-02-03 Sourav Chatterjee , Kannan Soundararajan