Occupation Times for Jump Processes
Probability
2011-02-25 v1
Abstract
We consider a class of pure jump Markov processes in 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.
Keywords
Cite
@article{arxiv.1102.5049,
title = {Occupation Times for Jump Processes},
author = {Brian M. Whitehead},
journal= {arXiv preprint arXiv:1102.5049},
year = {2011}
}