SearcharxivSearch

arXiv · 2005.08491

Construction and heat kernel estimates of general stable-like Markov processes

Abstract

A stable-like process is a Feller process $(X_t)_{t\geq 0}$ taking values in $\mathbb{R}^d$ and whose generator behaves, locally, like an $\alpha$-stable L\'evy process, but the index $\alpha$ and all other characteristics may depend on the state space. More precisely, the jump measure need not to be symmetric and it strongly depends on the current state of the process; moreover, we do not require the gradient term to be dominated by the pure jump part. Our approach is to understand the above phenomena as suitable microstructural perturbations. We show that the corresponding martingale problem is well-posed, and its solution is a strong Feller process which admits a transition density. For the transition density we obtain a representation as a sum of an explicitly given principal term -- this is essentially the density of an $\alpha$-stable random variable whose parameters depend on the current state $x$ -- and a residual term; the $L^\infty\otimes L^1$-norm of the residual term is negligible and so is, under an additional structural assumption, the $L^\infty\otimes L^\infty$-norm. Concrete examples illustrate the relation between the assumptions and possible transition density estimates.

Explore related subjects

Keep this discovery

BibTeXRIS

V. Knopova, A. Kulik, R. Schilling. 2020-05-18. Construction and heat kernel estimates of general stable-like Markov processes. https://arxiv.org/abs/2005.08491

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR