SearcharxivSearch

arXiv · 2010.08585

Well-posedness and tamed Euler schemes for McKean-Vlasov equations driven by L\'evy noise

Abstract

We prove the well-posedness of solutions to McKean-Vlasov stochastic differential equations driven by L\'evy noise under mild assumptions where, in particular, the L\'evy measure is not required to be finite. The drift, diffusion and jump coefficients are allowed to be random, can grow super-linearly in the state variable, and all may depend on the marginal law of the solution process. We provide a propagation of chaos result under more relaxed conditions than those existing in the literature, and consistent with our well-posedness result. We propose a tamed Euler scheme for the associated interacting particle system and prove that the rate of its strong convergence is arbitrarily close to $1/2$. As a by-product, we also obtain the corresponding results on well-posedness, propagation of chaos and strong convergence of the tamed Euler scheme for McKean-Vlasov stochastic delay differential equations (SDDE) and McKean-Vlasov stochastic differential equations with Markovian switching (SDEwMS), both driven by L\'evy noise. Furthermore, our results on tamed Euler schemes are new even for ordinary SDEs driven by L\'evy noise and with super-linearly growing coefficients.

Explore related subjects

Keep this discovery

BibTeXRIS

Neelima, Sani Biswas, Chaman Kumar, Gonçalo dos Reis, Christoph Reisinger. 2020-10-16. Well-posedness and tamed Euler schemes for McKean-Vlasov equations driven by L\'evy noise. https://arxiv.org/abs/2010.08585

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