Random doubly stochastic tridiagonal matrices
DOI10.1002/rsa.20452zbMath1278.15035OpenAlexW2002496835MaRDI QIDQ2841678
Persi Diaconis, Philip Matchett Wood
Publication date: 26 July 2013
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20452
algorithmeigenvalueMarkov chainrandom matrixeigenfunctioncutoff phenomenonJacobi polynomialbirth and death chaintridiagonal doubly stochastic matrices
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Stochastic matrices (15B51)
Related Items
Cites Work
- Enumeration formulas for Young tableaux in a diagonal strip
- The \(f\)-vector of the descent polytope
- Continuum limits of random matrices and the Brownian carousel
- Total variation cutoff in birth-and-death chains
- The number of faces of the tridiagonal Birkhoff polytope
- Generalized parking functions, descent numbers, and chain polytopes of ribbon posets
- Gibbs sampling, exponential families and orthogonal polynomials
- Cutoff phenomena for random walks on random regular graphs
- Separation cut-offs for birth and death chains
- The cutoff phenomenon for ergodic Markov processes
- Two poset polytopes
- Strong uniform times and finite random walks
- Trailing the dovetail shuffle to its lair
- Eigenvalue curves of asymmetric tridiagonal random matrices
- Tridiagonal doubly stochastic matrices
- Eigenvalue distributions of large Hermitian matrices; Wigner's semi- circle law and a theorem of Kac, Murdock, and Szegö
- Abrupt convergence and escape behavior for birth and death chains
- Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope
- The cutoff phenomenon for randomized riffle shuffles
- Generating a random permutation with random transpositions
- Iterated Random Functions
- On the Sums ∑ k = -∞ ∞ (4k + 1) -n
- A central limit theorem for iterated random functions
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
- Matrix models for beta ensembles
- Increasing trees and alternating permutations
- The cutoff phenomenon in finite Markov chains.
- On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications
- Probability Inequalities for Sums of Bounded Random Variables
- Fastest Mixing Markov Chain on a Path
- On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
- Unnamed Item
- Unnamed Item