SearcharxivSearch

arXiv · 1403.1040

Convergence Types and Rates in Generic Karhunen-Lo\`eve Expansions with Applications to Sample Path Properties

Abstract

We establish a Karhunen-Lo`eve expansion for generic centered, second order stochastic processes, which does not rely on topological assumptions. We further investigate in which norms the expansion converges and derive exact average rates of convergence for these norms. For Gaussian processes we additionally prove certain sharpness results in terms of the norm. Moreover, we show that the generic Karhunen-Lo`eve expansion can in some situations be used to construct reproducing kernel Hilbert spaces (RKHSs) containing the paths of a version of the process. As applications of the general theory, we compare the smoothness of the paths with the smoothness of the functions contained in the RKHS of the covariance function and discuss some small ball probabilities. Key tools for our results are a recently shown generalization of Mercer's theorem, spectral properties of the covariance integral operator, interpolation spaces of the real method, and for the smoothness results, entropy numbers of embeddings between classical function spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Ingo Steinwart. 2014-03-05. Convergence Types and Rates in Generic Karhunen-Lo\`eve Expansions with Applications to Sample Path Properties. https://arxiv.org/abs/1403.1040

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