Abstract

Consider a random subset K of ℝd. A basic problem in probabilistic potential theory is the following: For what nonrandom sets E is ℙ(K ∩ E ≠ ø) positive ? The archetypal example of such a set K is the range of a random field. Let X = (X t ; t ∈ ℝ N+ ) denote an N-parameter stochastic process that takes its values in ℝd and consider the random set K = {X s : s ∈ ℝ N+ }.1 For this particular random set K, the above question translates to the following: When does the random function X ever enter a given nonrandom set E with positive probability? Even though we will study a large class of random fields in the next chapter, the solution to the above problem is sufficiently involved that it is best to start with the easiest one-parameter case, which is the subject of the present chapter. Even in this simpler one-parameter setting, it is not clear, a priori, why such problems are interesting. Thus, our starting point will be the analysis of recurrence phenomena for one-parameter Markov processes that have nice properties. To illustrate the key ideas without having to deal with too many technical issues, our discussion of recurrence concentrates on Lévy processes. The astute reader may recognize Section 1 below as the continuous-time analogue of the results of the first section of Chapter 3.KeywordsBrownian MotionTransition DensityGauge FunctionFinite ConstantLevy ProcessThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.