A self-normalized law of the iterated logarithm for Rademacher random multiplicative functions
math.PR, math.NT
Submitted: 2026-10-29
Updated: 2026-10-29
License: http://creativecommons.org/licenses/by/4.0/
The gist: Let f be a Rademacher random multiplicative function supported on the squarefree integers, and let M(x)= sum n at most xf(n).
Abstract
Let f be a Rademacher random multiplicative function supported on the squarefree integers, and let M(x)= sum n at most xf(n). We prove a two-sided law of the iterated logarithm normalized by the full predictable quadratic variation Q(x)= sum p at most x (sumf(m)) squared of the martingale obtained by revealing the prime signs. Almost surely, x to infinity M(x) over sqrt 2Q(x) x=1, x to infinity M(x) over sqrt 2Q(x) x=-1. The same equalities hold with Q(x) in the denominator. The almost sure cluster set of the normalized sum is [-1,1]. This gives a self-normalized version of the questions of Wintner and Erdős on almost sure fluctuations. We also prove that Q(x)/q(x) cannot converge in probability to 1 for any positive deterministic function q. Moreover, [ x to infinity M(x) over sqrt x (x) 1/4] is either an almost surely finite and positive random variable with nondegenerate distribution or infinite almost surely. We do not determine which alternative holds.
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Repeated averaging on random d-regular graphs
- Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves