SearcharxivSearch

arXiv · 1803.04369

Differential Equations Driven by Variable Order H\"older Noise, and the Regularizing Effect of Delay

Abstract

In this article we extend the framework of rough paths to processes of variable H\"older exponent or variable order paths. We show how a class of multiple discrete delay differential equations driven by signals of variable order are especially well suited to be studied in a path wise sense. In fact, under some assumptions on the H\"older regularity functions of the driving signal, the local H\"older regularity of the variable order signal may be close to 0, without more than C_{b}^{2} diffusion coefficients (in contrast to higher regularity requirements known from constant order rough path theory). Furthermore, we give a canonical algorithm to construct the iterated integral of variable order on the domain \left[0,T\right]^{2}, by constructing the iterated integrals on some well chosen strip around the diagonal of \left[0,T\right]^{2}, and then extending it to the whole domain using Chens relation. At last, we give a recollection of the results of rough paths found in [FriHai], but tailored for variable order paths.

Explore related subjects

Keep this discovery

BibTeXRIS

Fabian A. Harang. 2018-03-12. Differential Equations Driven by Variable Order H\"older Noise, and the Regularizing Effect of Delay. https://arxiv.org/abs/1803.04369

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