Approximations for Stochastic McKean-Vlasov Equations with Non-Lipschitz Coefficients by an Euler-Maruyama Scheme
Tekijät
Päivämäärä
2023Tekijänoikeudet
© The Author(s)
In this thesis we study stochastic McKean-Vlasov equations. These are stochastic
differential equations where the coefficients depend also on the distribution of the
solution. This dependency adds to the complexity of the equation so in this thesis we
will study these equations using a discrete approximation.
We focus on considering the existence of a unique strong solution to stochastic
McKean-Vlasov equations using a discrete and recursive Euler-Maruyama approximation,
as well as the convergence rate of the approximation. Our main source is
the article Euler-Maruyama Approximations for Stochastic McKean-Vlasov Equations
with Non-Lipschitz Coefficients written by Xiaojie Ding and Huijie Qiao, which we
follow throughout this thesis.
In the thesis we recall some preliminary theory surrounding stochastic processes and
stochastic differential equations and introduce some results. We give the definitions
for weak and strong solutions for the McKean-Vlasov equation as well as the definition
for the martingale problem. We also introduce some useful inequalities. We give
the assumptions under which we work in this thesis, such as the assumption that the
coefficients of the McKean-Vlasov equations satisfy some non-Lipschitz conditions.
One of the main results in this thesis is to show the existence of unique strong solutions.
We approach this in two steps: first, we show the recursive construction of the
Euler-Maruyama approximation. With this approximation we show that there exists
a solution to the martingale problem and hence we get the existence of a weak solution.
Then, using Ito’s formula we prove that pathwise uniqueness holds under our assumptions.
After these two steps we show that the existence of a strong unique
solution can be proven. We also investigate with the help of Ito’s formula the convergence
rate of the Euler-Maruyama approximation used to show the existence of the
solution.
...
Asiasanat
Metadata
Näytä kaikki kuvailutiedotKokoelmat
- Pro gradu -tutkielmat [29564]
Lisenssi
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
On Malliavin calculus and approximation of stochastic integrals for Lévy processes
Laukkarinen, Eija (University of Jyväskylä, 2012) -
Mean square rate of convergence for random walk approximation of forward-backward SDEs
Geiss, Christel; Labart, Céline; Luoto, Antti (Cambridge University Press (CUP), 2020)Let (Y, Z) denote the solution to a forward-backward stochastic differential equation (FBSDE). If one constructs a random walk from the underlying Brownian motion B by Skorokhod embedding, one can show -convergence of ... -
Existence, uniqueness and Malliavin differentiability of Lévy-driven BSDEs with locally Lipschitz driver
Geiss, Christel; Steinicke, Alexander (Taylor & Francis, 2020)We investigate conditions for solvability and Malliavin differentiability of backward stochastic differential equations driven by a Lévy process. In particular, we are interested in generators which satisfy a local Lipschitz ... -
Donsker-type theorem for BSDEs : Rate of convergence
Briand, Philippe; Geiss, Christel; Geiss, Stefan; Labart, Céline (International Statistical Institute, 2021)In this paper, we study in the Markovian case the rate of convergence in Wasserstein distance when the solution to a BSDE is approximated by a solution to a BSDE driven by a scaled random walk as introduced in Briand, ... -
Approximation of heat equation and backward SDEs using random walk : convergence rates
Luoto, Antti (University of Jyväskylä, 2018)This thesis addresses questions related to approximation arising from the fields of stochastic analysis and partial differential equations. Theoretical results regarding convergence rates are obtained by using discretization ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.