SearcharxivSearch

arXiv · 0712.3415

Predicting the Last Zero of Brownian Motion with Drift

Abstract

Given a standard Brownian motion $B^μ=(B_t^μ)_{0\le t\le T}$ with drift $μ\in IR$ and letting $g$ denote the last zero of $B^μ$ before $T$, we consider the optimal prediction problem V_*=\inf_{0\le τ\le T}\mathsf {E}\:|\:g-τ| where the infimum is taken over all stopping times $τ$ of $B^μ$. Reducing the optimal prediction problem to a parabolic free-boundary problem and making use of local time-space calculus techniques, we show that the following stopping time is optimal: τ_*=\inf {t\in [0,T] | B_t^μ \le b_-(t) or B_t^μ \ge b_+(t)} where the function $t\mapsto b_-(t)$ is continuous and increasing on $[0,T]$ with $b_-(T)=0$, the function $t\mapsto b_+(t)$ is continuous and decreasing on $[0,T]$ with $b_+(T)=0$, and the pair $b_-$ and $b_+$ can be characterised as the unique solution to a coupled system of nonlinear Volterra integral equations. This also yields an explicit formula for $V_*$ in terms of $b_-$ and $b_+$. If $μ=0$ then $b_-=-b_+$ and there is a closed form expression for $b_{\pm}$ as shown in [10] using the method of time change from [4]. The latter method cannot be extended to the case when $μ\ne 0$ and the present paper settles the remaining cases using a different approach.

Explore related subjects

Keep this discovery

BibTeXRIS

J. du Toit, G. Peskir, A. N. Shiryaev. 2007-12-20. Predicting the Last Zero of Brownian Motion with Drift. https://arxiv.org/abs/0712.3415

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