On massive sets for subordinated random walks
Abstract
We study massive (reccurent) sets with respect to a certain random walk defined on the integer lattice , . Our random walk is obtained from the simple random walk on by the procedure of discrete subordination. can be regarded as a discrete space and time counterpart of the symmetric -stable L\'{e}vy process in . In the case we show that some remarkable proper subsets of , e.g. the set of primes, are massive whereas some proper subsets of such as Leitmann primes are massive/non-massive depending on the function . Our results can be regarded as an extension of the results of McKean (1961) about massiveness of the set of primes for the simple random walk in . In the case we study massiveness of thorns and their proper subsets.
Cite
@article{arxiv.1401.3972,
title = {On massive sets for subordinated random walks},
author = {Alexander Bendikov and Wojciech Cygan},
journal= {arXiv preprint arXiv:1401.3972},
year = {2016}
}
Comments
16 pages, 1 figure