Multiplicities of eigenvalues of some linear search schemes

We consider the problem of dynamically reorganizing a linear list when the list is subject to a random number of requests during a unit time interval. Three different heuristics are considered in which the selected items are moved to the front of the list in random order, the same order and finally...

Full description

Saved in:
Bibliographic Details
Published inLinear algebra and its applications Vol. 291; no. 1; pp. 115 - 124
Main Authors Pryde, A.J., Phatarfod, R.M.
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.04.1999
Subjects
Eigenvalues
Move-to-front
Multi-request heuristic
Permutations
Eigenvalues
Permutations
Multi-request heuristic
60K35
Move-to-front
15A18
Online AccessGet full text
ISSN0024-3795
1873-1856
DOI10.1016/S0024-3795(98)10246-X

Cover

More Information
Summary:We consider the problem of dynamically reorganizing a linear list when the list is subject to a random number of requests during a unit time interval. Three different heuristics are considered in which the selected items are moved to the front of the list in random order, the same order and finally the opposite order to the previous one. We find the eigenvalues and their multiplicities for the corresponding transition probability matrices. These are given in terms of the weights representing the probability of selection of the individual items. The methods employed are purely algebraic, being based on properties of permutations, and so our results are valid for arbitrary complex weights.
ISSN:0024-3795
1873-1856
DOI:10.1016/S0024-3795(98)10246-X