SearcharxivSearch

arXiv · 1509.00675

Bayesian sequential testing of the drift of a Brownian motion

Abstract

We study a classical Bayesian statistics problem of sequentially testing the sign of the drift of an arithmetic Brownian motion with the $0$-$1$ loss function and a constant cost of observation per unit of time for general prior distributions. The statistical problem is reformulated as an optimal stopping problem with the current conditional probability that the drift is non-negative as the underlying process. The volatility of this conditional probability process is shown to be non-increasing in time, which enables us to prove monotonicity and continuity of the optimal stopping boundaries as well as to characterize them completely in the finite-horizon case as the unique continuous solution to a pair of integral equations. In the infinite-horizon case, the boundaries are shown to solve another pair of integral equations and a convergent approximation scheme for the boundaries is provided. Also, we describe the dependence between the prior distribution and the long-term asymptotic behaviour of the boundaries.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erik Ekström, Juozas Vaicenavicius. 2015-09-02. Bayesian sequential testing of the drift of a Brownian motion. https://arxiv.org/abs/1509.00675

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