SearcharxivSearch

arXiv · 1209.0952

Parametric estimation of the driving L\'evy process of multivariate CARMA processes from discrete observations

Abstract

We consider the parametric estimation of the driving L\'evy process of a multivariate continuous-time autoregressive moving average (MCARMA) process, which is observed on the discrete time grid $(0,h,2h,...)$. Beginning with a new state space representation, we develop a method to recover the driving L\'evy process exactly from a continuous record of the observed MCARMA process. We use tools from numerical analysis and the theory of infinitely divisible distributions to extend this result to allow for the approximate recovery of unit increments of the driving L\'evy process from discrete-time observations of the MCARMA process. We show that, if the sampling interval $h=h_N$ is chosen dependent on $N$, the length of the observation horizon, such that $N h_N$ converges to zero as $N$ tends to infinity, then any suitable generalized method of moments estimator based on this reconstructed sample of unit increments has the same asymptotic distribution as the one based on the true increments, and is, in particular, asymptotically normally distributed.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter J. Brockwell, Eckhard Schlemm. 2012-09-05. Parametric estimation of the driving L\'evy process of multivariate CARMA processes from discrete observations. https://doi.org/10.1016/j.jmva.2012.09.004

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