SearcharxivSearch

arXiv · 1401.1069

Stability of hybrid Levy systems

Abstract

Continuous-time stochastic systems have attracted a lot of attention recently, due to their wide-spread use in finance for modelling price-dynamics. More recently models taking into accounts shocks have been developed by assuming that the return process is an infinitesimal Levy process. Levy processes are also used to model the traffic in a telecommunication network. In this paper we focus on a particular technical problem: stability of time-varying stochastic systems driven or modulated by a Levy process with discrete time interventions, such as parameter or state resetting. Such systems will be called hybrid Levy systems. They are hybrid in the sense that jumps both in the dynamics may occur. The peculiarity of our systems is that the jump-times are defined by a more or less arbitrary point process, but there exists an asymmetry in the system dynamics. The novelty of our model relative to the theory of switching stochastic systems is two-fold. First, we allow slow time variation of the parameters, in a stochastic sense, without any statistical pattern, in the spirit of the classical stability result of Desoer. Secondly, we allow certain jumps (resetting) in the system parameters almost without any a priori condition.

Explore related subjects

Keep this discovery

BibTeXRIS

L. Gerencser, M. Manfay. 2014-01-06. Stability of hybrid Levy systems. https://arxiv.org/abs/1401.1069

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