On the Fourier transform of random Bernoulli convolutions

Abstract

We investigate random Bernoulli convolutions, namely, probability measures given by the infinite convolution \[ μω = k=1∞ ( δ0 + δλ1 λ2 … λk-1 λk2 ), \] where ω=(λk) is a sequence of i.i.d. random variables each following the uniform distribution on some fixed interval. We study the regularity of these measures and prove that when ( λ1)>2π, the Fourier transform μω is an L1 function almost surely. This in turn implies that the corresponding random self-similar set supporting μω has non-empty interior almost surely. This improves upon a previous bound due to Peres, Simon and Solomyak. Furthermore, under no assumptions on the value of E( λ1), we prove that μω will decay to zero at a polynomial rate almost surely.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…