On massive sets for subordinated random walks
From MaRDI portal
Publication:5265348
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3194856 (Why is no real title available?)
- A problem about prime numbers and the random walk. I
- Bounded gaps between primes
- Dirichlet forms and symmetric Markov processes.
- Dirichlet norms, capacities and generalized isoperimetric inequalities for Markov operators.
- Functional inequalities and subordination: Stability of Nash and Poincaré inequalities
- Generational Relations for the Abstract Group Simply Isomorphic with the Linear Fractional Group in the GF[2″]
- Nash type inequalities for fractional powers of non-negative self-adjoint operators
- Nombres premiers de la forme \([n^c]\). (Prime numbers of the form \([n^c]\))
- Random walks on groups and discrete subordination
- Recurrent Sets
- Recurrent and transient sets for 3-dimensional random walks
- Roth's theorem in the Piatetski-Shapiro primes
- Sobolev inequalities in disguise
- Ultracontractivity and Nash type inequalities
- \(\alpha \)-stable random walk has massive thorns
Cited in
(5)- Transition probability estimates for subordinate random walks
- Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
- Subgeometric rates of convergence for discrete-time Markov chains under discrete-time subordination
- On subordinate random walks
- \(\alpha \)-stable random walk has massive thorns
This page was built for publication: On massive sets for subordinated random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265348)