Perron eigenvector of the Tsetlin matrix (Q1870036): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Michał Zając / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Identity for the Schur Complement of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stationary distribution of an interesting Markov chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of a theorem concerning an interesting Markov chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncoupling the Perron eigenvector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the matrix occurring in a linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the move-to-front scheme with Markov dependent requests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicities of eigenvalues of some linear search schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR / rank
 
Normal rank

Latest revision as of 15:43, 5 June 2024

scientific article
Language Label Description Also known as
English
Perron eigenvector of the Tsetlin matrix
scientific article

    Statements

    Perron eigenvector of the Tsetlin matrix (English)
    0 references
    0 references
    4 May 2003
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    move-to-front-scheme
    0 references
    Tsetlin library
    0 references
    Perron eigenvector
    0 references
    Perron complement
    0 references
    Markov chain
    0 references
    stochastic matrix
    0 references
    Tsetlin matrix
    0 references