SearcharxivSearch

arXiv · 2212.08866

Geometric decomposition of flows generated by rough path differential equations

Abstract

Whenever an It\^o-Wentsel type of formula holds for composition of flows of a certain differential dynamics, there exists locally a decomposition of the corresponding flow according to complementary distributions (or foliations, in the case of integrability of these distributions). Many examples have been proved in distinct context of dynamics: Stratonovich stochastic equations, L\'evy driven noise, low regularity $\alpha$-H\"older control functions ($ \alpha\in (1/2,1]$), see e.g. [6], [7], [20], [21]. Here we present the proof of this categorical property: we illustrate with the $\alpha$-H\"older rough path, $\alpha \in (1/3, 1/2]$ using the It\^o-Wentsel formula in this context proved in [5]. Different from the previous approaches, here however, instead of using an intrinsic rough path calculus on manifolds, the manifold has to be embedded in an Euclidean space. A cascade decomposition is also shown when we have multiple lower dimensional directions which span the whole space. As application, the linear case is treated in details: the cascade decomposition provides a row factorization of all matrices which allow real logarithm.

Explore related subjects

Keep this discovery

BibTeXRIS

Pedro Catuogno, Lourival Lima, Paulo Ruffino. 2022-12-17. Geometric decomposition of flows generated by rough path differential equations. https://arxiv.org/abs/2212.08866

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