SearcharxivSearch

arXiv · 2511.17015

A mixed fractional CIR model: positivity and an implicit Euler scheme

Abstract

We consider a Cox--Ingersoll--Ross (CIR) type short rate model driven by a mixed fractional Brownian motion. Let $M=B+B^H$ be a one-dimensional mixed fractional Brownian motion with Hurst index $H>1/2$, and let $\mathbf{M}=(M,\mathbb{M}^{\mathrm{It\hat{o}}})$ denote its canonical It\^o rough path lift. We study the rough differential equation \begin{equation}\label{eqn1} \dd r_t = k(\theta-r_t)\,\dd t + \sigma\sqrt{r_t}\,\dd\mathbf{M}_t,\qquad r_0>0, \end{equation} and prove that, under the Feller condition $2k\theta>\sigma^2$, the unique rough path solution is almost surely strictly positive for all times. The proof relies on an It\^o type formula for rough paths, together with refined pathwise estimates for the mixed fractional Brownian motion, including L\'evy's modulus of continuity for the Brownian part and a law of the iterated logarithm for the fractional component. As a consequence, the positivity property of the classical CIR model extends to this non-Markovian rough path setting. We also establish the convergence of an implicit Euler scheme for the associated singular equation obtained by a square-root transformation.

Explore related subjects

Keep this discovery

BibTeXRIS

Cong Zhang, Chunhao Cai. 2025-11-21. A mixed fractional CIR model: positivity and an implicit Euler scheme. https://arxiv.org/abs/2511.17015

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