SearcharxivSearch

arXiv · 2510.21446

Uniqueness of adapted solutions to scalar BSDEs with Peano-type generators

Abstract

A Backward Stochastic Differential Equation (BSDE) with a Peano-type generator, is known to have infinitely many solutions when the terminal value is vanishing, and is shown to have possibly multiple solutions even when the terminal value is not vanishing but nonnegative. In this paper, we study the uniqueness of adapted solutions of such a BSDE when the terminal value is almost surely positive. Two methods are developed. The first one is to connect the BSDE to an optimal stochastic control problem: under suitable integrability of the terminal values, with a verification argument, we prove that the first component of the adapted solution pair is the value process for the optimal stochastic control problem. The second one appeals to a change of variables, and is more inclined to analysis: by a change of variables, the original BSDE is reduced to a convex quadratic BSDE, and then using the $\theta$-difference method, we give a sharp result in some special case, which includes the BSDE governing the well-known Kreps-Porteus utility.

Explore related subjects

Keep this discovery

BibTeXRIS

Shengjun Fan, Ying Hu, Shanjian Tang. 2025-10-24. Uniqueness of adapted solutions to scalar BSDEs with Peano-type generators. https://arxiv.org/abs/2510.21446

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