SearcharxivSearch

arXiv · 1811.08013

Markov-Induced CM Model

Abstract

Conditionally Markov (CM) sequences are powerful mathematical tools for modeling random phenomena. There are several classes of CM sequences one of which is the reciprocal sequence. Reciprocal sequences have been widely used in many areas including image processing, intelligent systems, and acausal systems. To use them in application, we need not only their applicable dynamic models, but also some general approaches to designing parameters of dynamic models. Dynamic models governing two important classes of nonsingular Gaussian (NG) CM sequences (called $CM_L$ and $CM_F$ models), and a dynamic model governing the NG reciprocal sequence (called reciprocal $CM_L$ model) were presented in our previous work. In this paper, these models are studied in more detail and general approaches are presented for their parameter design. It is shown that every reciprocal $CM_L$ model can be induced by a Markov model and parameters of the reciprocal $CM_L$ model can be obtained from those of the Markov model. Also, it is shown how NG CM sequences can be represented in terms of an NG Markov sequence and an independent NG vector. This representation provides a general approach for parameter design of $CM_L$ and $CM_F$ models. In addition, it leads to a better understanding of CM sequences, including the reciprocal sequence.

Explore related subjects

Keep this discovery

BibTeXRIS

Reza Rezaie, X. Rong Li. 2018-11-19. Markov-Induced CM Model. https://arxiv.org/abs/1811.08013

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