English

Recurrence and transience of Rademacher series

Probability 2022-10-14 v2 Number Theory

Abstract

We introduce the notion of {\bf a}-walk S(n)=a1X1++anXnS(n)=a_1 X_1+\dots+a_n X_n, based on a sequence of positive numbers a=(a1,a2,){\bf a}=(a_1,a_2,\dots) and a Rademacher sequence X1,X2,X_1,X_2,\dots. We study recurrence/transience (properly defined) of such walks for various sequences of a{\bf a}. In particular, we establish the classification in the cases where ak=kβa_k=\lfloor k^\beta\rfloor, β>0\beta>0, as well as in the case ak=logγka_k=\lceil \log_\gamma k \rceil or ak=logγka_k=\log_\gamma k for γ>1\gamma>1.

Keywords

Cite

@article{arxiv.2205.14996,
  title  = {Recurrence and transience of Rademacher series},
  author = {Satyaki Bhattacharya and Stanislav Volkov},
  journal= {arXiv preprint arXiv:2205.14996},
  year   = {2022}
}