SearcharxivSearch

arXiv · 2511.18954

Geometric Rough Paths above Mixed Fractional Brownian Motion

Abstract

This paper establishes a comprehensive theory of geometric rough paths for mixed fractional Brownian motion (MFBM) and its generalized multi-component extensions. We prove that for a generalized MFBM of the form $M_t^H(a) = \sum_{k=1}^N a_k B_t^{H_k}$ with $\min\{H_k\} > \frac{1}{4}$, there exists a canonical geometric rough path obtained as the limit of smooth rough paths associated with dyadic approximations. This extends the classical result of Coutin and Qian \cite{coutin2002} for single fractional Brownian motion to the mixed case. We provide explicit bounds on the $p$-variation norms and establish a Skorohod integral representation connecting our pathwise construction to the Malliavin calculus framework. Furthermore, we demonstrate applications to rough differential equations driven by MFBM, enabling the use of Lyons' universal limit theorem for this class of processes. Finally, we study the signature of MFBM paths, providing a complete algebraic characterization of their geometric properties. Our approach unifies the treatment of multiple fractional components and reveals the fundamental interactions between different regularity scales, completing the rough path foundation for mixed fractional processes with applications in stochastic analysis and beyond.

Explore related subjects

Keep this discovery

BibTeXRIS

Atef Lechiheb. 2025-11-24. Geometric Rough Paths above Mixed Fractional Brownian Motion. https://arxiv.org/abs/2511.18954

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