The MathNet Korea
Information Center for Mathematical Science

PAC

Information Center for Mathematical Science

PAC

Random doubly stochastic tridiagonal matrices
Author Persi Diaconis (Stanford University)
Homepage Url http://www-stat.stanford.edu/~cgates/PERSI/year.html
Abstract Let Tn be the compact convex set of tridiagonal doubly stochastic matrices. These arise naturally in probability problems as birth and death chains with a uniform stationary distribution. We study ‘typical’ matrices T 2 Tn chosen uniformly at random in the set Tn. A simple algorithm is presented to allow direct sampling from the uniform distribution on Tn. Using this algorithm, the elements above the diagonal in T are shown to form a Markov chain. For large n, the limiting Markov chain is reversible and explicitly diagonalizable with transformed Jacobi polynomials as eigenfunctions. These results are used to study the limiting behavior of such typical birth and death chains, including their eigenvalues and mixing times. The results on a uniform random tridiagonal doubly stochastic matrices are related to the distribution of alternating permutations chosen uniformly at random.
Abstract Url http://www-stat.stanford.edu/~cgates/PERSI/papers/TriDiag1.pdf