SearcharxivSearch

arXiv · 2203.10687

A Constructive Brownian Limit Theorem

Abstract

In this paper, we present and prove a boundary limit theorem for Brownian motions for the Hardy space $\mathbf{h}^{p}$ of harmonic functions on the unit ball in $R^m$, where $p\geq1$ and $m\geq2$ are arbitrary. Our proof is constructive in the sense of [Bishop and Bridges 1985, Chan 2021, Chan 2022]. Roughly speaking, a mathematical proof is constructive if it can be compiled into some computer code with the guarantee of exit in a finite number of steps on execution. A constructive proof of said boundary limit theorem is contained in [Durret 1984] for the case of $p>1$. In this article, we give a constructive proof for $p=1$, which then implies, via the Lyapunov's inequality, a constructive proof for the general case $p\geq1$. We conjecture that the result can be used to give a constructive proof of the nontangential limit theorem for Hardy spaces $\mathbf{h}^{p}$ with $p\geq1$. We note that, ca 1970, R. Getoor gave a talk on the Brownian limit theorem at the University of Washington. We believe that the proof he presented is constructive only for the case $p>1$ and not for the case $p=1$. We are however unable to find a reference for his proof.

Explore related subjects

Keep this discovery

BibTeXRIS

Yuen-Kwok Chan. 2022-03-21. A Constructive Brownian Limit Theorem. https://arxiv.org/abs/2203.10687

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