A statistical approach for simulating the density solution of a McKean–Vlasov equation

We prove optimal convergence results of a stochastic particle method for computing the classical solution of a multivariate McKean–Vlasov equation, when the measure variable is in the drift, following the classical approach of [1, 11]. Our method builds upon adaptive nonparametric results in statistics that enable us to obtain a data-driven selection of the smoothing parameter in a kernel type estimator. In particular, we generalise the Bernstein inequality of [18] for mean-field McKean–Vlasov models to interacting particles Euler schemes and obtain sharp deviation inequalities for the estimated classical solution. We complete our theoretical results with a systematic numerical study, and gather empirical evidence of the benefit of using high-order kernels and data-driven smoothing parameters.

Institutions

Publication Details

Journal
SMAI Journal of Computational Mathematics
Published
2026-03-05
DOI
https://doi.org/10.5802/smai-jcm.138
Primary Topic
Stochastic Gradient Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A statistical approach for simulating the density solution of a McKean–Vlasov equation

SMAI Journal of Computational Mathematics
Stochastic Gradient Optimization Techniques
article

A statistical approach for simulating the density solution of a McKean–Vlasov equation

article en

Abstract

We prove optimal convergence results of a stochastic particle method for computing the classical solution of a multivariate McKean–Vlasov equation, when the measure variable is in the drift, following the classical approach of [1, 11]. Our method builds upon adaptive nonparametric results in statistics that enable us to obtain a data-driven selection of the smoothing parameter in a kernel type estimator. In particular, we generalise the Bernstein inequality of [18] for mean-field McKean–Vlasov models to interacting particles Euler schemes and obtain sharp deviation inequalities for the estimated classical solution. We complete our theoretical results with a systematic numerical study, and gather empirical evidence of the benefit of using high-order kernels and data-driven smoothing parameters.

SMAI Journal of Computational MathematicsVol. 12
Centre National de la Recherche Scientifique (FR), Université Paris Dauphine-PSL (FR)
Reduced inequalities
Openalex Percentile: Top 37%
Stochastic Gradient Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.