SearcharxivSearch

arXiv · 0704.0405

An invariance principle for semimartingale reflecting Brownian motions in domains with piecewise smooth boundaries

Abstract

Semimartingale reflecting Brownian motions (SRBMs) living in the closures of domains with piecewise smooth boundaries are of interest in applied probability because of their role as heavy traffic approximations for some stochastic networks. In this paper, assuming certain conditions on the domains and directions of reflection, a perturbation result, or invariance principle, for SRBMs is proved. This provides sufficient conditions for a process that satisfies the definition of an SRBM, except for small random perturbations in the defining conditions, to be close in distribution to an SRBM. A crucial ingredient in the proof of this result is an oscillation inequality for solutions of a perturbed Skorokhod problem. We use the invariance principle to show weak existence of SRBMs under mild conditions. We also use the invariance principle, in conjunction with known uniqueness results for SRBMs, to give some sufficient conditions for validating approximations involving (i) SRBMs in convex polyhedrons with a constant reflection vector field on each face of the polyhedron, and (ii) SRBMs in bounded domains with piecewise smooth boundaries and possibly nonconstant reflection vector fields on the boundary surfaces.

Explore related subjects

Keep this discovery

BibTeXRIS

W. Kang, R. J. Williams. 2007-04-03. An invariance principle for semimartingale reflecting Brownian motions in domains with piecewise smooth boundaries. https://doi.org/10.1214/105051606000000899

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