Multilevel Picard approximations for McKean-Vlasov stochastic differential equations

Abstract

In the literatur there exist approximation methods for McKean-Vlasov stochastic differential equations which have a computational effort of order $3$. In this article we introduce full-history recursive multilevel Picard (MLP) approximations for McKean-Vlasov stochastic differential equations. We prove that these MLP approximations have computational effort of order $2+$ which is essentially optimal in high dimensions.

References in corpus (9)

• Multilevel Picard iterations for solving smooth semilinear parabolic heat equations
• Overcoming the curse of dimensionality in the numerical approximation of semilinear parabolic partial differential equations
• Overcoming the curse of dimensionality in the numerical approximation of Allen-Cahn partial differential equations via truncated full-history recursive multilevel Picard approximations
• Multilevel Richardson-Romberg extrapolation
• Iterative Particle Approximation for McKean-Vlasov SDEs with application to Multilevel Monte Carlo estimation
• Interacting diffusions and trees of excursions: convergence and comparison
• Full history recursive multilevel Picard approximations for ordinary differential equations with expectations
• Propagation of chaos and the many-demes limit for weakly interacting diffusions in the sparse regime
• Iterative Multilevel density estimation for McKean-Vlasov SDEs via projections

Cited by in corpus (2)

• A flexible split-step scheme for solving McKean-Vlasov Stochastic Differential Equations
• Strong $L^p$-error analysis of nonlinear Monte Carlo approximations for high-dimensional semilinear partial differential equations