SearcharxivSearch

arXiv · 2405.16764

Multi-level reflecting Brownian motion on the half line and its stationary distribution

Abstract

A semi-martingale reflecting Brownian motion is a popular process for diffusion approximations of queueing models including their networks. In this paper, we are concerned with the case that it lives on the nonnegative half-line, but the drift and variance of its Brownian component discontinuously change at its finitely many states. This reflecting diffusion process naturally arises from a state-dependent single server queue, studied by the author (2024). Our main interest is in its stationary distribution, which is important for application. We define this reflecting diffusion process as the solution of a stochastic integral equation, and show that it uniquely exists in the weak sense. This result is also proved in a different way by Atar, Castiel and Reiman (2022,2023). In this paper, we consider its Harris irreducibility and stability, that is, positive recurrence, and derive its stationary distribution under this stability condition. The stationary distribution has a simple analytic expression, likely extendable to a more general state-dependent SRBM. Our proofs rely on the generalized Ito formula for a convex function and local time.

Explore related subjects

Keep this discovery

BibTeXRIS

Masakiyo Miyazawa. 2024-05-27. Multi-level reflecting Brownian motion on the half line and its stationary distribution. https://arxiv.org/abs/2405.16764

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