DocumentCode
1629679
Title
Who is the fairest of them all?
Author
Borkar, Vivek S. ; Makhijani, R.M.
Author_Institution
Dept. of Electr. Eng., IIT Bombay, Mumbai, India
fYear
2012
Firstpage
460
Lastpage
465
Abstract
We present a gossip algorithm for distributed computation of the Perron-Frobenius eigenvector of a nonnegative matrix. Potential applications to ranking schemes are given.
Keywords
approximation theory; eigenvalues and eigenfunctions; graph theory; matrix algebra; stochastic processes; Perron-Frobenius eigenvector; connected graph; distributed computation; gossip algorithm; nonnegative matrix; ranking schemes; stochastic approximation; Approximation algorithms; Approximation methods; Convergence; Eigenvalues and eigenfunctions; Limiting; Trajectory; Vectors; Perron-Frobenius eigenvector; gossip algorithm; ranking; stochastic approximation;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on
Conference_Location
Monticello, IL
Print_ISBN
978-1-4673-4537-8
Type
conf
DOI
10.1109/Allerton.2012.6483254
Filename
6483254
Link To Document