SearcharxivSearch

arXiv · math/0607109

Continuous-time GARCH processes

Abstract

A family of continuous-time generalized autoregressive conditionally heteroscedastic processes, generalizing the $\operatorname {COGARCH}(1,1)$ process of Klüppelberg, Lindner and Maller [J. Appl. Probab. 41 (2004) 601--622], is introduced and studied. The resulting $\operatorname {COGARCH}(p,q)$ processes, $q\ge p\ge 1$, exhibit many of the characteristic features of observed financial time series, while their corresponding volatility and squared increment processes display a broader range of autocorrelation structures than those of the $\operatorname {COGARCH}(1,1)$ process. We establish sufficient conditions for the existence of a strictly stationary nonnegative solution of the equations for the volatility process and, under conditions which ensure the finiteness of the required moments, determine the autocorrelation functions of both the volatility and the squared increment processes. The volatility process is found to have the autocorrelation function of a continuous-time autoregressive moving average process.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Brockwell, Erdenebaatar Chadraa, Alexander Lindner. 2006-07-05. Continuous-time GARCH processes. https://doi.org/10.1214/105051606000000150

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