Discretizing Malliavin calculus
Christian Bender, Peter Parczewski

TL;DR
This paper establishes necessary and sufficient conditions for the convergence of discretized Malliavin calculus operators and chaos decompositions, bridging continuous and discrete stochastic analysis.
Contribution
It provides rigorous $L^2$-convergence criteria for discretized Malliavin derivatives, Skorokhod integrals, and chaos coefficients, extending the theory to binary noise.
Findings
Conditions for weak and strong $L^2$-convergence of discretized operators
Convergence criteria for chaos coefficients in discrete approximations
Support for analogies between Wiener and Bernoulli Malliavin calculus
Abstract
Suppose is a Brownian motion and is an approximating sequence of rescaled random walks on the same probability space converging to pointwise in probability. We provide necessary and sufficient conditions for weak and strong -convergence of a discretized Malliavin derivative, a discrete Skorokhod integral, and discrete analogues of the Clark-Ocone derivative to their continuous counterparts. Moreover, given a sequence of random variables which admit a chaos decomposition in terms of discrete multiple Wiener integrals with respect to , we derive necessary and sufficient conditions for strong -convergence to a -measurable random variable via convergence of the discrete chaos coefficients of to the continuous chaos coefficients of . In the special case of binary noise, our results support the known formal analogies between…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
