Search arXivSearch

arXiv · 1306.2021

G-Brownian Motion as Rough Paths and Differential Equations Driven by G-Brownian Motion

Abstract

The present paper is devoted to the study of sample paths of G-Brownian motion and stochastic differential equations (SDEs) driven by G-Brownian motion from the view of rough path theory. As the starting point, we show that quasi-surely, sample paths of G-Brownian motion can be enhanced to the second level in a canonical way so that they become geometric rough paths of roughness 2 < p < 3. This result enables us to introduce the notion of rough differential equations (RDEs) driven by G-Brownian motion in the pathwise sense under the general framework of rough paths. Next we establish the fundamental relation between SDEs and RDEs driven by G-Brownian motion. As an application, we introduce the notion of SDEs on a differentiable manifold driven by GBrownian motion and construct solutions from the RDE point of view by using pathwise localization technique. This is the starting point of introducing G-Brownian motion on a Riemannian manifold, based on the idea of Eells-Elworthy-Malliavin. The last part of this paper is devoted to such construction for a wide and interesting class of G-functions whose invariant group is the orthogonal group. We also develop the Euler-Maruyama approximation for SDEs driven by G-Brownian motion of independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Xi Geng, Zhongmin Qian, Danyu Yang. 2013-06-09. G-Brownian Motion as Rough Paths and Differential Equations Driven by G-Brownian Motion. https://arxiv.org/abs/1306.2021

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