Let T be an almost regular tournament matrix of order n with right perron vector IL'. We show that if the ith row sum of T is (n -2)/2 and the jth row sum is n/2, then w, < u,,. Thus in the round robin competition corresponding to T, the ranking schemes of Kendall and Wei and of Kamanujacharyula agr
Perron vector ordering for a subclass of tournament matrices
β Scribed by Steve Kirkland
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 988 KB
- Volume
- 291
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
We consider the class of 11)( i1 tournament matrices having sCO!".' vector [1 1 2 3 ... 11 -4 11 -3 11 -2 II -2]', For each such matrix. we give formulas for the entries in its perron vector in terms of the corresponding pcrron value. This leads to a discussion of the ordering or the entries in the pcrron vector. and so yields some insight into the Kendall Wei method for ranking players in a round robin competition. Finally. we characterize all matrices from this class such that the ordering of the entries in the perron vector coincides with the ordering or the entries in the score vector.
π SIMILAR VOLUMES
We study a new approach to eigen-decomposition of symmetric matrices, called the vector field method. In contrast to the methods currently in use, the vector field method computes an eigenvector by computing a discrete approximation to the integral curve of a special tangent vector field on the unit
In self-consistent field (SCF) calculations the construction of the Fock matrix is most time-consuming step. The Fock matrix construction may formally be seen as a matrix-vector multiplication, where the matrix is the supermatrix, Tikl, and the vector is the first-order density matrix, yi. This form