SearcharxivSearch

arXiv · 1302.5606

Convergence analysis of some multivariate Markov chains using stochastic monotonicity

Abstract

We provide a nonasymptotic analysis of convergence to stationarity for a collection of Markov chains on multivariate state spaces, from arbitrary starting points, thereby generalizing results in [Khare and Zhou Ann. Appl. Probab. 19 (2009) 737-777]. Our examples include the multi-allele Moran model in population genetics and its variants in community ecology, a generalized Ehrenfest urn model and variants of the Polya urn model. It is shown that all these Markov chains are stochastically monotone with respect to an appropriate partial ordering. Then, using a generalization of the results in [Diaconis, Khare and Saloff-Coste Sankhya 72 (2010) 45-76] and [Wilson Ann. Appl. Probab. 14 (2004) 274-325] (for univariate totally ordered spaces) to multivariate partially ordered spaces, we obtain explicit nonasymptotic bounds for the distance to stationarity from arbitrary starting points. In previous literature, bounds, if any, were available only from special starting points. The analysis also works for nonreversible Markov chains, and allows us to analyze cases of the multi-allele Moran model not considered in [Khare and Zhou Ann. Appl. Probab. 19 (2009) 737-777].

Explore related subjects

Keep this discovery

BibTeXRIS

Kshitij Khare, Nabanita Mukherjee. 2013-02-22. Convergence analysis of some multivariate Markov chains using stochastic monotonicity. https://doi.org/10.1214/12-aap856

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