Multiplicative chaos measure for multiplicative functions: the L1-regime
Abstract
Let α be a Steinhaus random multiplicative function. For a wide class of multiplicative functions f we construct a multiplicative chaos measure arising from the Dirichlet series of α f, in the whole L1-regime. Our method does not rely on the thick point approach or Gaussian approximation, and uses a modified second moment method with the help of an approximate Girsanov theorem. We also employ the idea of weak convergence in Lr to show that the limiting measure is independent of the choice of the approximation schemes, and this may be seen as a non-Gaussian analogue of Shamov's characterisation of multiplicative chaos. Our class of f-s consists of those for which the mean value of |f(p)|2 lies in (0,1). In particular, it includes the indicator of sums of two squares. As an application of our construction, we establish a generalised central limit theorem for the (normalised) sums of α f, with random variance determined by the total mass of our measure.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.