Multilevel Picard approximations for McKean-Vlasov stochastic differential equations with jumps
Ariel Neufeld, Tuan Anh Nguyen, Philipp Schmocker
Source abstract
We introduce multilevel Picard (MLP) approximations of McKean-Vlasov stochastic differential equations (SDEs) with jumps of finite or infinite activity. Under Lipschitz and integrability assumptions on the coefficients, we show that the MLP algorithm does not suffer from the curse of dimensionality when approximating the solution of the McKean-Vlasov SDE. The latter means that its computational cost grows at most polynomially in both the state-space dimension of the SDE and the reciprocal of the prescribed error tolerance. In two numerical experiments, we demonstrate the practical applicability of the MLP algorithm for two different McKean-Vlasov SDEs in dimensions up to 200.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.