is assumed to be aperiodic and strongly connected, powers of the matrix C will converge to a stable value at some point. It seems that for a large value of x, the trust vector will converge to the same vector for every peer in the network. The vector is known as the left principal eigenvector of the matrix C. We also note that since is same for all nodes in the network, it represents the global trust value. Based on the results above a simple centralized trust value computing algorithm can be written. Note that we assume that all the local trust values for the whole network are available and present in the matrix C. We also note that, if the equation shown above converges, we can replace the initial vector by a vector that is an m-vector representing uniform probability distribution over all m peers. The basic EigenTrust algorithm is shown below: repeat until See also Markov chain Eigenvalues and eigenvectors in mathematics and physics Eigen (C++ library), a computer programming library for matrix and linear algebra operations References Peer-to-peer computing Reputation management