SearcharxivSearch

arXiv · 1304.6703

The Trace Problem for Toeplitz Matrices and Operators and its Impact in Probability

Abstract

The trace approximation problem for Toeplitz matrices and its applications to stationary processes dates back to the classic book by Grenander and Szeg\"o, "Toeplitz forms and their applications". It has then been extensively studied in the literature. In this paper we provide a survey and unified treatment of the trace approximation problem both for Toeplitz matrices and for operators and describe applications to discrete- and continuous-time stationary processes. The trace approximation problem serves indeed as a tool to study many probabilistic and statistical topics for stationary models. These include central and non-central limit theorems and large deviations of Toeplitz type random quadratic functionals, parametric and nonparametric estimation, prediction of the future value based on the observed past of the process, etc. We review and summarize the known results concerning the trace approximation problem, prove some new results, and provide a number of applications to discrete- and continuous-time stationary time series models with various types of memory structures, such as long memory, anti-persistent and short memory.

Explore related subjects

Keep this discovery

BibTeXRIS

Mamikon S. Ginovyan, Artur A. Sahakyan, Murad S. Taqqu. 2013-04-24. The Trace Problem for Toeplitz Matrices and Operators and its Impact in Probability. https://arxiv.org/abs/1304.6703

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