Mondrian
\
Trismegiste
Mondrian
Algebra
Analysis
Strategy
Builder
Compiler
Statement
Command
Config
Graph
Parser
Plugin
Refactor
Transform
Format
Logger
Vertex
Visitor

\Trismegiste\Mondrian\GraphPowerIteration

PowerIteration is a the a decorator for Power Iteration algorithm

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

Summary

Methods
Properties
Constants
__construct()
addEdge()
addVertex()
getEdgeSet()
getVertexSet()
searchEdge()
getSuccessor()
getEdgeIterator()
getPartition()
getEigenVectorSparse()
No public properties found
No constants found
No protected methods found
$graph
N/A
No private methods found
No private properties found
N/A

Properties

$graph

$graph :

Type

Methods

getEdgeSet()

getEdgeSet() : array

Get the edges set

Returns

array

getVertexSet()

getVertexSet() : array

Get the vertices in the graph

Returns

array

getSuccessor()

getSuccessor(\Trismegiste\Mondrian\Graph\Vertex  $v) : null|array

Get successors of a vertex

Parameters

\Trismegiste\Mondrian\Graph\Vertex $v

Returns

null|array —

null if the vertex is not in this graph

                    or an array of vertices

getEdgeIterator()

getEdgeIterator(\Trismegiste\Mondrian\Graph\Vertex  $v) : \Trismegiste\Mondrian\Graph\Iterator

Get an iterator on edges for one vertex

Parameters

\Trismegiste\Mondrian\Graph\Vertex $v

Returns

\Trismegiste\Mondrian\Graph\Iterator

getPartition()

getPartition()

Returns a list of subgraph

getEigenVectorSparse()

getEigenVectorSparse(float  $precision = 0.001) : \SplObjectStorage

Return the dominant eigenvector of the adjacency matrix of this graph

Parameters

float $precision

Returns

\SplObjectStorage