SearcharxivSearch

arXiv · 2411.19433

Singular mean-field backward stochastic Volterra integral equations in infinite dimensional spaces

Abstract

This paper investigates the well-posedness of singular mean-field backward stochastic Volterra integral equations (MF-BSVIEs) in infinite-dimensional spaces. We consider the equation: \[X(t) = \Psi(t) + \int_t^b P\big(t, s, X(s), \aleph(t, s), \aleph(s, t), \mathbb{E}[X(s)], \mathbb{E}[\aleph(t, s)], \mathbb{E}[\aleph(s, t)]\big) ds - \int_t^b \aleph(t, s) dB_s, \] where the focus lies on establishing the existence and uniqueness of adapted M-solutions under appropriate conditions. A key contribution of this work is the development of essential lemmas that provide a rigorous foundation for analyzing the well-posedness of these equations. In addition, we extend our analysis to singular mean-field forward stochastic Volterra integral equations (MF-FSVIEs) in infinite-dimensional spaces, demonstrating their solvability and unique adapted solutions. Finally, we strengthen our theoretical results by applying them to derive stochastic maximum principles, showcasing the practical relevance of the proposed framework. These findings contribute to the growing body of research on mean-field stochastic equations and their applications in control theory and mathematical finance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Javad A. Asadzade, Nazim I. Mahmudov. 2024-11-29. Singular mean-field backward stochastic Volterra integral equations in infinite dimensional spaces. https://arxiv.org/abs/2411.19433

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