Recurrence and transience of Rademacher series
Abstract
We introduce the notion of a-walk S(n)=a1 X1+…+an Xn, based on a sequence of positive numbers a=(a1,a2,…) and a Rademacher sequence X1,X2,…. We study recurrence/transience (properly defined) of such walks for various sequences of a. In particular, we establish the classification in the cases where ak= kβ, β>0, as well as in the case ak= γ k or ak=γ k for γ>1.
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.