Almost sure upper bound for sums of random multiplicative functions and critical chaos

Abstract: Let $f$ be a Steinhaus or Rademacher random multiplicative function. We use methods from the theory of critical chaos to improve on the best known upper bound for partial sums of random multiplicative functions. In particular, our results imply that for any $\varepsilon>0$, almost surely $$\Big|\sum_{n\le x}f(n)\Big| \ll_{f,\varepsilon}\sqrt{x}(\log_2x)^{{1/4}(\log_3x)^{{1+\varepsilon}.}}$$ This proves in a strong form a conjecture of Harper on large fluctuations of partial sums of random multiplicative functions, and determines the exact corresponding logarithmic exponent.