Now, let's consider that node A contains a value that we want to propagate to its neighbors. We can find how the value will be propagated through the graph with a simple dot product:
This is what happens if all the initial values are initialized to 1:
We are almost there. The only missing part to retrieving the PageRank formula is the damping factor d:
As you can see, we are getting the same values that we found in the previous sections. With this formalism, finding the rank of each node is equivalent to solving the following equation:
X' = (1-d) + d * M_n * X = X
In this equation, the values of the X vector are the PageRank centralities for each node.
Now, let's go back to eigenvector centrality.
