Random doubly stochastic tridiagonal matrices
algorithmbirth and death chaincutoff phenomenoneigenfunctioneigenvalueJacobi polynomialMarkov chainrandom matrixtridiagonal doubly stochastic matrices
Eigenvalues, singular values, and eigenvectors (15A18) Stochastic matrices (15B51) Random matrices (algebraic aspects) (15B52) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Numerical analysis or methods applied to Markov chains (65C40)
Let NEWLINE\[NEWLINE\mathcal{T}_n=\Bigg\{\left(\begin{smallmatrix} 1-c_1 &c_1 &0 &0 &\hdots &0\\ c_1&1-c_1-c_2&c_2 &0 &\hdots &0 &0\\ 0 &c_2 &1-c_2-c_3&c_3 &\hdots &0 &0\\ \vdots &\vdots &\vdots &\vdots&\ddots &\vdots &\vdots\\ 0 &0 &0 &0 &\hdots &1-c_{n-1}-c_n&c_n\\ 0 &0 &0 &0 &\hdots &c_n &1-c_n\end{smallmatrix}\right) \Big|\;0\leq c_i\in\mathbb R,\;i=1,\dots,n\Bigg\}NEWLINE\]NEWLINE 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. The authors study ``typical matrices \(T\in\mathcal T_n\) chosen uniformly at random in the set \(\mathcal T_n\). A simple algorithm is presented to allow direct sampling from the uniform distribution on \(\mathcal T_n\). 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.
- Tridiagonal doubly stochastic matrices
- Diagonal sums of doubly stochastic matrices†
- Diagonal sums of doubly stochastic matrices
- Doubly stochastic circulant matrices
- Tridiagonal random matrix: Gaussian fluctuations and deviations
- Diagonals of doubly stochastic and equiponderant matrices
- Even and odd diagonals in doubly stochastic matrices
- On diagonals of matrices doubly stochastically similar to a given matrix
- General tridiagonal random matrix models, limiting distributions and fluctuations
- scientific article; zbMATH DE number 3216216
- A central limit theorem for iterated random functions
- Abrupt convergence and escape behavior for birth and death chains
- Continuum limits of random matrices and the Brownian carousel
- Cutoff phenomena for random walks on random regular graphs
- Eigenvalue curves of asymmetric tridiagonal random matrices
- Eigenvalue distributions of large Hermitian matrices; Wigner's semi- circle law and a theorem of Kac, Murdock, and Szegö
- Enumeration formulas for Young tableaux in a diagonal strip
- Fastest Mixing Markov Chain on a Path
- Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope
- Generalized parking functions, descent numbers, and chain polytopes of ribbon posets
- Generating a random permutation with random transpositions
- Gibbs sampling, exponential families and orthogonal polynomials
- scientific article; zbMATH DE number 1358323 (Why is no real title available?)
- Increasing trees and alternating permutations
- Iterated Random Functions
- Matrix models for beta ensembles
- On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications
- On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
- On the Sums ∑ k = -∞ ∞ (4k + 1) -n
- Probability Inequalities for Sums of Bounded Random Variables
- Random dynamical systems. Theory and applications
- Separation cut-offs for birth and death chains
- Strong uniform times and finite random walks
- The \(f\)-vector of the descent polytope
- The cutoff phenomenon for ergodic Markov processes
- The cutoff phenomenon for randomized riffle shuffles
- The cutoff phenomenon in finite Markov chains.
- The number of faces of the tridiagonal Birkhoff polytope
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
- Total variation cutoff in birth-and-death chains
- Trailing the dovetail shuffle to its lair
- Tridiagonal doubly stochastic matrices
- Two poset polytopes
- Stochastic Airy semigroup through tridiagonal matrices
- Triangular random matrices and biorthogonal ensembles
- Cutoff at the ``entropic time for sparse Markov chains
- Tridiagonal doubly stochastic matrices
- Asymptotic behaviour of random tridiagonal Markov chains in biological applications
- Universality of cutoff for graphs with an added random matching
- Spectrum and eigenvectors for a class of tridiagonal matrices
- The cutoff phenomenon for random birth and death chains
- Asymptotic behaviour of random Markov chains with tridiagonal generators
- An adjacent-swap Markov chain on coalescent trees
- Diagonal sums of doubly stochastic matrices
- Introducing the Class of SemiDoubly Stochastic Matrices: A Novel Scaling Approach for Rectangular Matrices
- Almost triangular Markov chains on \(\mathbb{N}\)
- A random walk on the Rado graph
- Zig-zag Eulerian polynomials
- Spectral invariants of some tridiagonal matrices and applications to computing chemical indices
- Extensions of partial cyclic orders and consecutive coordinate polytopes
This page was built for publication: Random doubly stochastic tridiagonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841678)
