SearcharxivSearch

arXiv · 2403.09778

Existence and uniqueness for the solutions of non-autonomous stochastic differential algebraic equations with locally Lipschitz coefficients

Abstract

In this paper, we study the well-posedness and regularity of non-autonomous stochastic differential algebraic equations (SDAEs) with nonlinear, locally Lipschitz and monotone (2) coefficients of the form (1). The main difficulty is the fact that the operator A(.) is non-autonomous, i.~e. depends on t and the matrix $A(t)$ is singular for all $t\in \left[0,T\right]$. Our interest is in SDAE of index-1. This means that in order to solve the problem, we can transform the initial SDAEs into an ordinary stochastic differential equation with algebraic constraints. Under appropriate hypothesizes, the main result establishes the existence and uniqueness of the solution in $\mathcal{M}^p(\left[0, T\right], \mathbb{R}^n)$, $p\geq 2$, $p\in \mathbb{N}$. Several strong estimations and regularity results are also provided. Note that, in this paper, we use various techniques such as It\^o's lemma, Burkholder-Davis-Gundy inequality, and Young inequality.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oana Silvia Serea, Antoine Tambue, Guy Tsafack. 2024-03-14. Existence and uniqueness for the solutions of non-autonomous stochastic differential algebraic equations with locally Lipschitz coefficients. https://arxiv.org/abs/2403.09778

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