PHP 클래스 Trismegiste\Mondrian\Graph\PowerIteration
In mathematics, the power iteration is an eigenvalue algorithm: given a
matrix A, the algorithm will produce a number λ (the eigenvalue) and a
nonzero vector v (the eigenvector), such that Av = λv. The algorithm is
also known as the Von Mises iteration.[1]
http://en.wikipedia.org/wiki/Power_iteration
In general, there will be many different eigenvalues for which an
eigenvector solution exists. However, the additional requirement that all
the entries in the eigenvector be positive implies (by the Perron–Frobenius
theorem) that only the greatest eigenvalue results in the desired centrality
measure.[12] The component of the related eigenvector then gives the
centrality score of the vertex in the network. Power iteration is one of
many eigenvalue algorithms that may be used to find this
dominant eigenvector.
http://en.wikipedia.org/wiki/Eigenvector_centrality#Eigenvector_centrality
파일 보기
프로젝트 열기: trismegiste/mondrian
1 사용 예제들
공개 메소드들
| 메소드 |
설명 |
|
|
getEigenVectorSparse ( float $precision = 0.001 ) : SplObjectStorage |
Return the dominant eigenvector of the adjacency matrix of
this graph |
|
메소드 상세
getEigenVectorSparse()
공개 메소드
Return the dominant eigenvector of the adjacency matrix of
this graph