REVIEW 1 cited by
Mean square rate of convergence for random walk approximation of forward-backward SDEs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
Let (Y, Z) denote the solution to a forward-backward SDE. If one constructs a random walk B n from the underlying Brownian motion B by Skorohod embedding, one can show L 2 convergence of the corresponding solutions (Y n , Z n) to (Y, Z). We estimate the rate of convergence in dependence of smoothness properties, especially for a terminal condition function in C 2,$\alpha$. The proof relies on an approximative representation of Z n and uses the concept of discretized Malliavin calculus. Moreover, we use growth and smoothness properties of the PDE associated to the FBSDE as well as of the finite difference equations associated to the approximating stochastic equations. We derive these properties by stochastic methods.
Forward citations
Cited by 1 Pith paper
-
Donsker-Type Theorem for BSDEs: Rate of Convergence
The random walk approximation for Markovian BSDEs converges in Wasserstein distance at rate n^{-(α∧ε/2)}, improving n^{-ε/4} and reaching the CLT-optimal n^{-1/2} for Lipschitz data.
Discussion (0). Continue with ORCID to comment.