SearcharxivSearch

arXiv · 1111.1682

On the uniform convergence of random series in Skorohod space and representations of c\`{a}dl\`{a}g infinitely divisible processes

Abstract

Let $X_n$ be independent random elements in the Skorohod space $D([0,1];E)$ of c\`{a}dl\`{a}g functions taking values in a separable Banach space $E$. Let $S_n=\sum_{j=1}^nX_j$. We show that if $S_n$ converges in finite dimensional distributions to a c\`{a}dl\`{a}g process, then $S_n+y_n$ converges a.s. pathwise uniformly over $[0,1]$, for some $y_n\in D([0,1];E)$. This result extends the It\^{o}-Nisio theorem to the space $D([0,1];E)$, which is surprisingly lacking in the literature even for $E=R$. The main difficulties of dealing with $D([0,1];E)$ in this context are its nonseparability under the uniform norm and the discontinuity of addition under Skorohod's $J_1$-topology. We use this result to prove the uniform convergence of various series representations of c\`{a}dl\`{a}g infinitely divisible processes. As a consequence, we obtain explicit representations of the jump process, and of related path functionals, in a general non-Markovian setting. Finally, we illustrate our results on an example of stable processes. To this aim we obtain new criteria for such processes to have c\`{a}dl\`{a}g modifications, which may also be of independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Andreas Basse-O'Connor, Jan Rosiński. 2011-11-07. On the uniform convergence of random series in Skorohod space and representations of c\`{a}dl\`{a}g infinitely divisible processes. https://doi.org/10.1214/12-aop783

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