Rate of convergence of a particle method to the solution of the McKean-Vlasov equation (Q1872380): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1214/aoap/1026915611 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1214/AOAP/1026915611 / rank
 
Normal rank

Latest revision as of 10:54, 16 December 2024

scientific article
Language Label Description Also known as
English
Rate of convergence of a particle method to the solution of the McKean-Vlasov equation
scientific article

    Statements

    Rate of convergence of a particle method to the solution of the McKean-Vlasov equation (English)
    0 references
    0 references
    0 references
    6 May 2003
    0 references
    This paper studies the rate of convergence of an appropriate discretization scheme of the solution of the McKean-Vlasov equation introduced by Bossy and Talay. More specifically, the authors consider approximations of the distribution and of the density of the solution of the stochastic differential equation associated to the McKean-Vlasov equation. The scheme adopted here is a mixed one: Euler-weakly interacting particle system. If \(n\) is the number of weakly interacting particles and \(h\) is the uniform step in the time discretization, they prove that the rate of convergence of the distribution functions of the approximating sequence in the \(L^1(\Omega\times R)\) norm is of the order of \(1/(\sqrt{n}+h)\), while for the densities is of the order \((h+1)/\sqrt{n}h^{1/4}\). The rates of convergence with respect to the supremum norm are also calculated. This result is obtained by carefully employing techniques of Malliavin calculus.
    0 references
    McKean-Vlasov equation
    0 references
    Malliavin calculus
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references