SearcharxivSearch

arXiv · 1911.05280

The Value of the High, Low and Close in the Estimation of Brownian Motion: Extended Version

Abstract

The conditional density of Brownian motion is considered given the max, B(t|\max), as well as those with additional information: B(t|close, max), B(t|close, max, min) and B(t|max, min) where the close is the final value: B(t=1)=c and t in [0,1]. The conditional expectation and conditional variance of Brownian motion are evaluated subject to one or more of the the close (final value), the high (maximum), the low (minimum). Computational results displaying both the expectation and variance in time are presented and compared with the theoretical values. We tabulate the time averaged variance of Brownian motion conditional on knowing various extremal properties of the motion. The final table shows that knowing the high is more useful than knowing the final value among other results. Knowing the open, high, low and close reduces the time averaged variance to 42% of the value of knowing only the open and close (Brownian bridge).

Explore related subjects

Keep this discovery

BibTeXRIS

Kurt S Riedel. 2019-11-13. The Value of the High, Low and Close in the Estimation of Brownian Motion: Extended Version. https://arxiv.org/abs/1911.05280

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR