Pith. sign in

REVIEW 1 cited by

An optimal polynomial approximation of Brownian motion

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

arxiv 1904.06998 v3 pith:VROCHXXU submitted 2019-04-15 math.NA cs.NAmath.PR

classification math.NAcs.NAmath.PR
keywords brownianmotionapproximationpiecewisepolynomialscoefficientscomparedgaussian
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this paper, we will present a strong (or pathwise) approximation of standard Brownian motion by a class of orthogonal polynomials. The coefficients that are obtained from the expansion of Brownian motion in this polynomial basis are independent Gaussian random variables. Therefore it is practical (requires $N$ independent Gaussian coefficients) to generate an approximate sample path of Brownian motion that respects integration of polynomials with degree less than $N$. Moreover, since these orthogonal polynomials appear naturally as eigenfunctions of an integral operator defined by the Brownian bridge covariance function, the proposed approximation is optimal in a certain weighted $L^{2}(\mathbb{P})$ sense. In addition, discretizing Brownian paths as piecewise parabolas gives a locally higher order numerical method for stochastic differential equations (SDEs) when compared to the standard piecewise linear approach. We shall demonstrate these ideas by simulating Inhomogeneous Geometric Brownian Motion (IGBM). This numerical example will also illustrate the deficiencies of the piecewise parabola approximation when compared to a new version of the asymptotically efficient log-ODE (or Castell-Gaines) method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning stochastic differential equations using RNN with log signature features

    cs.LG 2019-08 conditional novelty 6.0 of 10

    A hybrid network that feeds coarse log-signature features into an RNN is universal for SDE solution maps and beats baseline RNNs on action and gesture recognition benchmarks.

Pith tools