SearcharxivSearch

arXiv · 2605.30616

Brownian motion: the hyperbolic number setting

Abstract

The purpose of this paper is to define normal Gaussian variables in the setting of hyperbolic probabilities, and introduce an associated Brownian motion, when both the index and the values of the process lie in the real algebra $\mathbb{H}$ of hyperbolic numbers. In Hida's white noise space, we construct two probability measures (say $P_1$ and $P_2$), and associate to them two families of $N(0,1)$ variables $(Z_n)_{n\in\mathbb N_0}$ (independent with respect to $P_1$) and $(W_n)_{n\in\mathbb N_0}$ (independent with respect to $P_2$). An important feature is that the $Z_n$ and $W_m$ need not be mutually independent either with respect to $P_1$ or $P_2$. An hyperbolic normal Gaussian variable is constructed (in non-degenerate cases) from two classical Gaussian variables and the hyperbolic Brownian motion is, in general, composed from two copies of the classical Brownian motion. Using the associated Gelfand triples we also compute the derivative of the hyperbolic Brownian motion as a stochastic distribution. The argument extends to the $\mathbb{H}$-valued fractional Brownian motion, and more generally to a wide family of $\mathbb{H}$-valued stationary-increment second order processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Alpay, Ilwoo Cho, Liora Mayats-Alpay. 2026-05-28. Brownian motion: the hyperbolic number setting. https://arxiv.org/abs/2605.30616

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