SearcharxivSearch

arXiv · 2010.13279

Self-Switching Markov Chains: emerging dominance phenomena

Abstract

In many dynamical systems in nature, the law of the dynamics changes along with the temporal evolution of the system. These changes are often associated with the occurrence of certain events. The timing of occurrence of these events depends, in turn, on the trajectory of the dynamical system itself, making the dynamics of the system and the timing of a change in the dynamics strongly coupled. Naturally, trajectories that take longer to satisfy the event will last longer. Therefore, we expect to observe more frequently the dominant dynamics, the ones that take longer to change in the long run. This article proposes a Markov chain model, called Self-Switching Markov Chain (SSMC), in which the emergence of dominant dynamics can be rigorously addressed. We present conditions and scaling in the SSMC under which we observe with probability one only the subset of dominant dynamics, and we characterize these dominant dynamics. Furthermore, we show that the switching between dynamics exhibits metastability-like property.

Explore related subjects

Keep this discovery

BibTeXRIS

S. Gallo, G. Iacobelli, G. Ost, D. Y. Takahashi. 2020-10-26. Self-Switching Markov Chains: emerging dominance phenomena. https://arxiv.org/abs/2010.13279

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