Search arXivSearch

arXiv · math/0412092

On Skorohod spaces as universal sample path spaces

Abstract

The paper presents a factorization theorem for a certain class of stochastic processes. Skorohod spaces carry the rich structure of standard Borel spaces and appear to be suitable universal sample path spaces. We show that, if $ξ$ is a RCLL stochastic process with values in a complete separable metric space $E$, any other RCLL stochastic process $X$ adapted to the filtration induced by $ξ$ factors through the Skorohod space $D_E[0,\infty)$. This can be understood as an extension of a stochastic process to a standard Borel space enjoying nice properties. Moreover, the trajectories of the factorized stochastic process defined on $D_E[0,\infty)$ inherit the properties of being continuous, non-decreasing, and of bounded variation, resp., from those of $X$. Considering situations which are invariant under the factorization procedure, the main theorem is a reduction tool to assume the underlying measurable space be a standard Borel space. In an example, we pick the existence theorem of regular conditional probabilities on standard Borel spaces to simplify a conditional expectation appearing in stochastic control problems.

Explore related subjects

Keep this discovery

BibTeXRIS

Oliver Delzeith. 2004-12-06. On Skorohod spaces as universal sample path spaces. https://arxiv.org/abs/math/0412092

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