Original algorithm used for calculating the importance of nodes in a network, especially used by google as part of their ranking algorithm for websites. A random walk is initiated with uniform probability for choosing the next connected node. Some nodes are visited more often which have connections with many other important nodes. By keeping track of the times a node is visited we can give it a value of importance.
jghms
commented
6 years ago
Original algorithm used for calculating the importance of nodes in a network, especially used by google as part of their ranking algorithm for websites. A random walk is initiated with uniform probability for choosing the next connected node. Some nodes are visited more often which have connections with many other important nodes. By keeping track of the times a node is visited we can give it a value of importance.