Milstein-type schemes for McKean-Vlasov SDEs driven by Brownian motion and Poisson random measure (with super-linear coefficients)
Sani Biswas, Chaman Kumar, Christoph Reisinger, Verena Schwarz
TL;DR
This work advances numerical methods for McKean–Vlasov SDEs driven by Brownian motion and Lévy noise by introducing a Milstein-type scheme that accommodates super-linear growth in the state variable and linear dependence on the measure. The authors establish strong $L^2$-convergence near order one through a taming strategy and a detailed Itô calculus for interacting particle systems, leveraging Lions derivatives to handle measure interactions under a coercivity framework. A key contribution is the explicit rate of convergence $n^{-1-2/(\varepsilon+2)}$, which, together with propagation-of-chaos results, yields precise total error bounds for the fully discrete particle approximation of MV SDEs. These results provide a rigorous foundation for high-accuracy simulations of mean-field models with jumps and non-Lipschitz dynamics, with potential impact on finance, physics, and biology where such systems arise.
Abstract
In this work, we present a general Milstein-type scheme for McKean-Vlasov stochastic differential equations (SDEs) driven by Brownian motion and Poisson random measure and the associated system of interacting particles where drift, diffusion and jump coefficients may grow super-linearly in the state variable and linearly in the measure component. The strong rate of $\mathcal{L}^2$-convergence of the proposed scheme is shown to be arbitrarily close to one under appropriate regularity assumptions on the coefficients. For the derivation of the Milstein scheme and to show its strong rate of convergence, we provide an Itô formula for the interacting particle system connected with the McKean-Vlasov SDE driven by Brownian motion and Poisson random measure. Moreover, we use the notion of Lions derivative to examine our results. The two-fold challenges arising due to the presence of the empirical measure and super-linearity of the jump coefficient are resolved by identifying and exploiting an appropriate coercivity-type condition.
