SearcharxivSearch

arXiv · 2206.08782

Multivariate continuous-time autoregressive moving-average processes on cones

Abstract

In this article we study multivariate continuous-time autoregressive moving-average (MCARMA) processes with values in convex cones. More specifically, we introduce matrix-valued MCARMA processes with L\'evy noise and present necessary and sufficient conditions for processes from this class to be cone valued. We derive specific hands-on conditions in the following two cases: First, for classical MCARMA on $\mathbb{R}_{d}$ with values in the positive orthant $\mathbb{R}_{d}^{+}$. Second, for MCARMA processes on real square matrices taking values in the cone of symmetric and positive semi-definite matrices. Both cases are relevant for applications and we give several examples of positivity ensuring parameter specifications. In addition to the above, we discuss the capability of positive semi-definite MCARMA processes to model the spot covariance process in multivariate stochastic volatility models. We justify the relevance of MCARMA based stochastic volatility models by an exemplary analysis of the second order structure of positive semi-definite well-balanced Ornstein-Uhlenbeck based models.

Explore related subjects

Keep this discovery

BibTeXRIS

Fred Espen Benth, Sven Karbach. 2022-06-17. Multivariate continuous-time autoregressive moving-average processes on cones. https://doi.org/10.1016/j.spa.2023.05.003

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