SearcharxivSearch

arXiv · 2301.07992

Countable-state stochastic processes with c\`adl\`ag sample paths

Abstract

The Daniell-Kolmogorov Extension Theorem is a fundamental result in the theory of stochastic processes, as it allows one to construct a stochastic process with prescribed finite-dimensional distributions. However, it is well-known that the domain of the constructed probability measure - the product sigma-algebra in the set of all paths - is not sufficiently rich. This problem is usually dealt with through a modification of the stochastic process, essentially changing the sample paths so that they become c\`adl\`ag. Assuming a countable state space, we provide an alternative version of the Daniell-Kolmogorov Extension Theorem that does not suffer from this problem, in that the domain is sufficiently rich and we do not need a subsequent modification step: we assume a rather weak regularity condition on the finite-dimensional distributions, and directly obtain a probability measure on the product sigma-algebra in the set of all c\`adl\`ag paths.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Erreygers, Jasper De Bock. 2023-01-19. Countable-state stochastic processes with c\`adl\`ag sample paths. https://arxiv.org/abs/2301.07992

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