Markov chain approximations to stochastic differential equations by recombination on lattice trees
We revisit the classical problem of approximating a stochastic differential equation by a discrete-time and discrete-space Markov chain. Our construction iterates Caratheodory's theorem over time to match the moments of the increments locally. This allows to construct a Markov chain with a spar...
Main Authors: | Cosentino, F, Oberhauser, H, Abate, A |
---|---|
Format: | Internet publication |
Language: | English |
Published: |
2021
|
Similar Items
-
Carathéodory sampling for stochastic gradient descent
by: Cosentino, F, et al.
Published: (2020) -
Carathéodory sampling for stochastic gradient descent
by: Cosentino, F, et al.
Published: (2020) -
Adaptive formal approximations of Markov chains
by: Abate, A, et al.
Published: (2021) -
Multiscale stochastic reaction–diffusion algorithms combining Markov chain models with stochastic partial differential equations
by: Kang, HW, et al.
Published: (2019) -
Numerical approximations for stochastic differential equations
by: Foster, JM
Published: (2020)