Particle method and quantization-based schemes for the simulation of the McKean-Vlasov equation

From MaRDI portal
Publication:6422136

DOI10.1051/M2AN/2024007arXiv2212.14853WikidataQ128593282 ScholiaQ128593282MaRDI QIDQ6422136FDOQ6422136


Authors: Yating Liu Edit this on Wikidata


Publication date: 30 December 2022

Abstract: In this paper, we study three numerical schemes for the McKean-Vlasov equation [�egin{cases} ;dX_t=b(t, X_t, mu_t) , dt+sigma(t, X_t, mu_t) , dB_t,: \ ;forall, tin[0,T],;mu_t ext{ is the probability distribution of }X_t, end{cases}] where X0 is a known random variable. Under the assumption on the Lipschitz continuity of the coefficients b and sigma, our first result proves the convergence rate of the particle method with respect to the Wasserstein distance, which extends a previous work [BT97] established in one-dimensional setting. In the second part, we present and analyse two quantization-based schemes, including the recursive quantization scheme (deterministic scheme) in the Vlasov setting, and the hybrid particle-quantization scheme (random scheme, inspired by the K-means clustering). Two examples are simulated at the end of this paper: Burger's equation and the network of FitzHugh-Nagumo neurons in dimension 3.





Recommendations




Cited In (2)





This page was built for publication: Particle method and quantization-based schemes for the simulation of the McKean-Vlasov equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6422136)