SearcharxivSearch

arXiv · math/0610103

Reflected diffusions defined via the extended Skorokhod map

Abstract

This work introduces the extended Skorokhod problem (ESP) and associated extended Skorokhod map (ESM) that enable a pathwise construction of reflected diffusions that are not necessarily semimartingales. Roughly speaking, given the closure G of an open connected set in R^J, a non-empty convex cone d(x) in R^J, specified at each point x on the boundary of G, and a cadlag trajectory ψtaking values in R^J, the ESM defines a constrained version ϕof ψthat takes values in G and is such that the increments of ϕ- ψon any interval [s,t] lie in the closed convex hull of the directions d(ϕ(u)), u in (s,t]. General deterministic properties of the ESP are first established under the only assumption that the graph of d(.) is closed. Next, for a class of multi-dimensional ESPs on polyhedral domains, pathwise uniqueness and existence of strong solutions to the associated stochastic differential equations is established. In addition, it is also proved that these reflected diffusions are semimartingales on [0,τ_0], where τ_0 is the time to hit the set of points x on the boundary for which d(x) contains a line. One motivation for the study of this class of reflected diffusions is that they arise as approximations of queueing networks in heavy traffic that use the so-called generalised processor sharing discipline.

Explore related subjects

Keep this discovery

BibTeXRIS

K. Ramanan. 2006-10-03. Reflected diffusions defined via the extended Skorokhod map. https://arxiv.org/abs/math/0610103

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