Composition Marcov chains of multinomial type

Advances in Applied Probability

Volumn 41, Issue 1, 2009, Pages 270-291

  Zhou, Hua ^a,b   Lange, Kenneth ^c  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Coalescent time; Convergence rate; Ehrenfest chain; Inhomogeneous Markov chain; Krawtchouk polynomial; Orthogonal polynomial; Random walk

Indexed keywords

COALESCENT TIME; CONVERGENCE RATE; EHRENFEST CHAIN; INHOMOGENEOUS MARKOV CHAIN; KRAWTCHOUK POLYNOMIAL; ORTHOGONAL POLYNOMIAL; RANDOM WALK;

COALESCENCE; FOURIER ANALYSIS; INCANDESCENT LAMPS; MARKOV PROCESSES; NUCLEIC ACIDS;

POLYNOMIALS;

EID: 67649646387     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1240319585     Document Type: Article

References (25)

1. BARR, D. R. AND THOMAS, M. U. (1977). An eigenvector condition for Markov chain lumpability. Operat. Res. 25, 1028-1031.
2. BOYD, S., DIACONIS, P., PARRILIO, P. AND XIAO, L. (2005). Symmetry analys is of reversible Markov chains. Internet Math. 2, 31-71.
3. COBB G. W. AND CHEN, Y-P. (2003). An application of Markov chain Monte Carlo to community ecology. Amer. Math. Monthly 110, 265-288.
4. DIACONIS, P. (1988). Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward, CA.
5. DIACONIS, P., KHARE, K. AND SALOFF-COSTE, L. (2008). Gibbs sampling, exponential families and orthogonal polynomials. Statist. Sci. 23, 151-200.
6. ERDOS, P., R_ACEnyi, A. AND S_ACOS, V. T. (1966). On a problem of graph theory. Studia Sci. Math. Hung. 1, 215-235.
7. FELLER, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. I, 3rd edn. John Wiley, New York.
8. GRAHAM, R. L., KNUTH, D. E. AND PATASHNIK, O. (1989). Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Reading, MA.
9. GRIFFITHS, R. C. (1971). Orthogonal polynomials on the multinomial distribution. Austral. J. Statist. 13, 27-35.
10. GRIFFITHS, R. C. (2007). Notes on 'Aprobabilistic origin for a new class of bivariate polynomials' by M. R. Hoare and M. Rahman. Unpublished notes.
11. HENRICI, P. (1979). Fast Fourier methods in computational complex analysis. SIAM Rev. 21, 481-527.
12. HOARE, M. R. AND RAHMAN, M. (2008). Aprobabilistic origin for a new class of bivariate polynomials. SIGMA 4, 089.
13. ISMAIL, M. E. H. (2005). Classical and Quantum Orthogonal Polynomials in One Variable (Encyclopaedia Math. Appl. 98). Cambridge University Press.
14. ILIEV, P. AND XU, Y. (2007). Discrete orthogonal polynomials and difference equations of several variables. Adv. Math. 212, 1-36.
15. KAC, M. (1947). Random walk and the theory of Brownian motion. Amer. Math. Monthly 54, 369-391.
16. KARLIN, S. AND MCGREGOR, J. (1965). Ehrenfest urn models. J. Appl. Prob. 2, 352-376.
17. KARLIN, S. AND TAYLOR, H. M. (1975). A First Course in Stochastic Processes. Academic Press, New York.
18. KARLIN, S. AND TAYLOR, H. M. (1981). A Second Course in Stochastic Processes. Academic Press, New York.
19. KEMENY, J. G. AND SNELL, J. L. (1983). Finite Markov Chains. Springer, New York.
20. KHARE, K. AND ZHOU, H. (2009). Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions. To appear in Ann. Appl. Prob.
21. KIMURA, M. (1980). A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. J. Molec. Evol. 16, 111-120.
22. LANGE, K. (1999). Numerical Analysis for Statisticians. Springer, New York.
23. LAZZERONI, L. C. AND LANGE, K. (1997). Markov chains for Monte Carlo tests ofgenetic equilibrium in multi dimensional contingency tables. Ann. Statist. 25, 138-168.
24. Rao, C. R., Rao, M. B. AND ZHANG, H. (2007). One bulb? Two bulbs? How many bulbs light up - a discrete probability problem involving dermal patches. Sankhyā 69, 137-161.
25. TIAN, J. P. AND LIU, Z. (2007). Coalescent random walks on graphs. J. Comput. Appl. Math. 202, 144-154.