Well-posedness and tamed schemes for McKean-Vlasov Equations with Common Noise
Chaman Kumar, Neelima, Christoph Reisinger, and Wolfgang Stockinger

TL;DR
This paper proves well-posedness for McKean-Vlasov SDEs with common noise and introduces explicit tamed Euler and Milstein schemes that are stable and converge strongly, supported by numerical examples.
Contribution
It establishes well-posedness for McKean-Vlasov equations with super-linear coefficients and develops stable, convergent tamed numerical schemes for these equations.
Findings
Proved well-posedness of McKean-Vlasov SDEs with common noise.
Developed explicit tamed Euler and Milstein schemes with proven stability and convergence.
Numerical examples demonstrate the effectiveness of the proposed methods.
Abstract
In this paper, we first establish well-posedness of McKean-Vlasov stochastic differential equations (McKean-Vlasov SDEs) with common noise, possibly with coefficients having super-linear growth in the state variable. Second, we present stable time-stepping schemes for this class of McKean-Vlasov SDEs. Specifically, we propose an explicit tamed Euler and tamed Milstein scheme for an interacting particle system associated with the McKean-Vlasov equation. We prove stability and strong convergence of order and , respectively. To obtain our main results, we employ techniques from calculus on the Wasserstein space. The proof for the strong convergence of the tamed Milstein scheme only requires the coefficients to be once continuously differentiable in the state and measure component. To demonstrate our theoretical findings, we present several numerical examples, including mean-field…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
