SearcharxivSearch

arXiv · 2004.07363

A detailed and direct proof of Skorohod-Wichura's theorem

Abstract

The representation Skorohod theorem of weak convergence of random variables on a metric space goes back to Skorohod (1956) in the case where the metric space is the class of real-valued functions defined on [0,1] which are right-continuous and have left-hand limits when endowed with the Skorohod metric. Among the extensions of that to metric spaces, the version by Wichura (1970) seems to be the most fundamental. But the proof of Wichura seems to be destined to a very restricted public. We propose a more detailed proof to make it more accessible at the graduate level. However we do far more by simplifying it since important steps in the original proof are dropped, which leads to a direct proof that we hope to be more understandable to a larger spectrum of readers. The current version is more appropriate for different kinds of generalizations.

Explore related subjects

Keep this discovery

BibTeXRIS

Gane Samb Lo, Aladji Babacar Niang, Lois Chinwendu Okereke. 2020-04-15. A detailed and direct proof of Skorohod-Wichura's theorem. https://arxiv.org/abs/2004.07363

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