SearcharxivSearch

arXiv · 2407.05140

Uniqueness for the Skorokhod problem in an orthant: critical cases

Abstract

Consider the Skorokhod problem in the closed non-negative orthant: find a solution $(g(t),m(t))$ to \[ g(t)= f(t)+ Rm(t),\] where $f$ is a given continuous vector-valued function with $f(0)$ in the orthant, $R$ is a given $d\times d$ matrix with 1's along the diagonal, $g$ takes values in the orthant, and $m$ is a vector-valued function that starts at 0, each component of $m$ is non-decreasing and continuous, and for each $i$ the $i^{th}$ coordinate of $m$ increases only when the $i^{th}$ coordinate of $g$ is 0. The stochastic version of the Skorokhod problem replaces $f$ by the paths of Brownian motion. It is known that there exists a unique solution to the Skorokhod problem if the spectral radius of $|Q|$ is less than 1, where $Q=I-R$ and $|Q|$ is the matrix whose entries are the absolute values of the corresponding entries of $Q$. The first result of this paper shows pathwise uniqueness for the stochastic version of the Skorokhod problem holds if the spectral radius of $|Q|$ is equal to 1. The second result of this paper settles the remaining open cases for uniqueness for the deterministic version when the dimension $d$ is two.

Explore related subjects

Keep this discovery

BibTeXRIS

Richard F. Bass, Krzysztof Burdzy. 2024-07-06. Uniqueness for the Skorokhod problem in an orthant: critical cases. https://arxiv.org/abs/2407.05140

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