SearcharxivSearch

arXiv · 1706.07616

Markov processes of cubic stochastic matrices: {\it Quadratic stochastic processes}

Abstract

We consider Markov processes of cubic stochastic (in a fixed sense) matrices which are also called quadratic stochastic process (QSPs). A QSP is a particular case of a continuous-time dynamical system whose states are stochastic cubic matrices satisfying an analogue of the Kolmogorov-Chapman equation (KCE). Since there are several kinds of multiplications between cubic matrices we have to fix first a multiplication and then consider the KCE with respect to the fixed multiplication. Moreover, the notion of stochastic cubic matrix also varies depending on the real models of application. The existence of a stochastic (at each time) solution to the KCE provides the existence of a QSP. In this paper, our aim is to construct QSPs for two specially chosen notions of stochastic cubic matrices and two multiplications of such matrices (known as Maksimov's multiplications). We construct a wide class of QSPs and give some time-dependent behavior of such processes. We give an example with applications to the Biology, constructing a QSP which describes the time behavior (dynamics) of a population with the possibility of twin births.

Explore related subjects

Keep this discovery

BibTeXRIS

J. M. Casas, M. Ladra, U. A. Rozikov. 2017-06-23. Markov processes of cubic stochastic matrices: {\it Quadratic stochastic processes}. https://arxiv.org/abs/1706.07616

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