Multiplicities of eigenvalues of some linear search schemes
β Scribed by A.J. Pryde; R.M. Phatarfod
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 541 KB
- Volume
- 291
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
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 arc given in terms of the weights representing the probability of selection of tile individual items. The methods employed arc purely algebraic, being based on properties of permutations, and so our results arc valid fOf arbitrary complex weights.
π SIMILAR VOLUMES
Using multiplicities of eigenvalues of elliptic self-adjoint differential operators on graphs and transversality, we construct some new invariants of graphs which are related to tree-width.
We summarize seventeen equivalent conditions for the equality of algebraic and geometric multiplicities of an eigenvalue for a complex square matrix. As applications, we give new proofs of some important results related to mean ergodic and positive matrices.