A stochastic particle method for the McKean-Vlasov and the Burgers equation

Abstract

In this paper we introduce and analyze a stochastic particle method for the McKean-Vlasov and the Burgers equation; the construction and error analysis are based upon the theory of the propagation of chaos for interacting particle systems. Our objective is three-fold. First, we consider a McKean-Vlasov equation in [0,T] x R with sufficiently smooth kernels, and the PDEs giving the distribution function and the density of the measure μ t , the solution to the McKean-Vlasov equation. The simulation of the stochastic system with N particles provides a discrete measure which approximates μkΔt for each time kΔt (where Δt is a discretization step of the time interval [0, T]). An integration (resp. smoothing) of this discrete measure provides approximations of the distribution function (resp. density) of μkΔt. We show that the convergence rate is O (1/√N+ for the approximation in L i (Ω x R) of the cumulative distribution function at time T, and of order O (e 2 +1/e) (1/√N + √Δt for the approximation in L l (Ω x R) of the density at time T (Ω is the underlying probability space, e is a smoothing parameter). Our second objective is to show that our particle method can be modified to solve the Burgers equation with a nonmonotonic initial condition, without modifying the convergence rate O (1/√N+√Δt). This part extends earlier work of ours, where we have limited ourselves to monotonic initial conditions. Finally, we present numerical experiments which confirm our theoretical estimates and illustrate the numerical efficiency of the method when the viscosity coefficient is very small.