Abstract

We prove an almost sure invariance principle for the capacity and the cardinality of the range of a class of α-stable random walks on the integer lattice Zd with d/α>5/2, and d/α>3/2, respectively. As a direct consequence, we conclude Khintchine’s and Chung’s laws of the iterated logarithm for both processes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call