Discrete approximation of symmetric jump processes on metric measure spaces

From MaRDI portal
Publication:1950377



Abstract: In this paper we give general criteria on tightness and weak convergence of discrete Markov chains to symmetric jump processes on metric measure spaces under mild conditions. As an application, we investigate discrete approximation for a large class of symmetric jump processes. We also discuss some application of our results to the scaling limit of random walk in random conductance.


From the text: ``The paper is concerned with the following two questions. (Q1) Given a symmetric Hunt process \(X\) on \(\mathbb R^d\), can it be approximated by a sequence of symmetric Markov chains \(X^{(k)}\) on \(k^{-1}\mathbb Z^d\)? (Q2) For a sequence \(\{ X^{(k)}:\;k\geq 1\}\) of symmetric Markov chains on \(k^{-1}\mathbb Z^d\), when does \(X^{(k)}\) converge weakly to a `nice' Hunt process \(X\) on \(\mathbb R^d\), as \(k\to \infty\)? In this paper, we address these two questions for symmetric processes \(X\) of pure jump type on a general metric space \(E\).



Cites work


Cited in
(30)








This page was built for publication: Discrete approximation of symmetric jump processes on metric measure spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950377)