SearcharxivSearch

arXiv · 1510.06310

Approximation of delay differential equations at the verge of instability by equations without delay

Abstract

We consider linear delay differential equations at the verge of Hopf instability, i.e. a pair of roots of the characteristic equation are on the imaginary axis of the complex plane and all other roots have negative real parts. When nonlinear and noise perturbations are present, we show that the error in approximating the dynamics of the delay system by certain two dimensional stochastic differential equation without delay is small (in an appropriately defined sense). Two cases are considered: (i) linear perturbations and multiplicative noise (ii) cubic perturbations and additive noise. The two-dimensional system without-delay is related to the projection of the delay equation onto the space spanned by the eigenfunctions corresponding to the imaginary roots of the characteristic equation. A part of this article is an attempt to relax the Lipschitz restriction imposed on the coefficients in doi:10.1142/S0219493716500131 Also, the multiplicative noise case was not considered there. Examples without rigorous proofs are worked in arXiv:1403.3029

Explore related subjects

Keep this discovery

BibTeXRIS

Nishanth Lingala. 2015-10-21. Approximation of delay differential equations at the verge of instability by equations without delay. https://arxiv.org/abs/1510.06310

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