Perron eigenvector of the Tsetlin matrix
A library with \(n\geq 3\) books is considered. Fix \(k\), \(1\leq k\leq n\). Move-to-position \(k\) scheme is considered, i.e. at each unit of time a book is removed and is put back in the \(k\)th position. Let \(P=(p_{ij})\) be an \(n\times n\) stochastic matrix, where \(p_{ij}\) is the probability that if the \(i\)th book is requested at the given unit of time, then at the subsequent unit of time the \(j\)th book is requested. The transition matrix of the associated Markov chain on \(S_n\) is called the \(k\)th Tsetlin matrix of \(P\) and denoted by \(\mathcal T_{k}(P)\). Some identities involving Perron complement are shown and used to obtain the main results of the paper: formulae for left Perron eigenvectors of \(\mathcal T_{k}(P)\) for \(k=1\), \(k=2\), \(k=n\), \(k=n-1\). The problem of finding expressions for left Perron eigenvectors of \(\mathcal T_{k}(P)\) for \(2<k<n-1\) remains open.
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- On the transition probabilities of the move-to-front scheme
- Properties of the promotion Markov chain on linear extensions
- Random shuffles on trees using extended promotion
- On the matrix occurring in a linear search problem
- An extension of a theorem concerning an interesting Markov chain
- An Identity for the Schur Complement of a Matrix
- FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
- scientific article; zbMATH DE number 795110 (Why is no real title available?)
- Multiplicities of eigenvalues of some linear search schemes
- On the matrix occurring in a linear search problem
- On the move-to-front scheme with Markov dependent requests
- The stationary distribution of an interesting Markov chain
- Uncoupling the Perron eigenvector problem
This page was built for publication: Perron eigenvector of the Tsetlin matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870036)
