Occupation Times for Jump Processes

Abstract

We consider a class of pure jump Markov processes in d whose jump kernels are comparable to those of symmetric stable processes. We prove a support theorem, a lower bound on the occupation times of sets, and show that we can approximate resolvents using smooth functions.

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…