On massive sets for subordinated random walks

Abstract

We study massive (reccurent) sets with respect to a certain random walk Sα defined on the integer lattice Z d, d=1,2. Our random walk Sα is obtained from the simple random walk S on Z d by the procedure of discrete subordination. Sα can be regarded as a discrete space and time counterpart of the symmetric α -stable L\'evy process in Rd. In the case d=1 we show that some remarkable proper subsets of Z , e.g. the set P of primes, are massive whereas some proper subsets of P such as Leitmann primes Ph are massive/non-massive depending on the function h. 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 Z3. In the case d=2 we study massiveness of thorns and their proper subsets.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…