SearcharxivSearch

arXiv · 2609.06606

Rough backward stochastic differential equations

Abstract

We develop an intrinsic well-posedness theory for nonlinear backward stochastic differential equations (BSDEs) driven simultaneously by Brownian motion and a (level-$2$) rough path of finite $p$-variation. Unlike earlier approaches based on smooth approximation or transformation methods, we formulate the equation directly by viewing its solution as a rough semimartingale (in the sense of \cite{friz2023rough}). This framework is particularly suited to BSDEs, whose Brownian martingale component is only implicitly defined and lacks the \emph{a priori} time regularity required by stochastic-sewing-based controlled rough path methods \cite{fhl21,allan2024rough}. We establish comparison, existence, uniqueness, and stability under the natural regularity condition $H\in C_b^\gamma$, $\gamma>p$. The main analytical difficulty, namely, the loss of integrability arising from nonlinear composition, is overcome through conditional $p$-variation norms with BMO-type properties. Finally, by randomizing the rough driver as a Brownian rough path, we establish a direct correspondence between rough BSDEs and backward doubly stochastic differential equations (BDSDEs).

Explore related subjects

Keep this discovery

BibTeXRIS

Peter K. Friz, Jian Song, Huilin Zhang, Kuan Zhang. 2026-09-06. Rough backward stochastic differential equations. https://arxiv.org/abs/2609.06606

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