Suppose you want to find the most influential user of Twitter. You would need to know not only how many followers everyone has, but also who those followers are, who the followers of those followers are, and so on. This is a graph problem. Graphs are a mathematical structure that model relationships between entities, whether they’re people, computers, proteins or even abstract concepts.
It turns out that there is already a very popular algorithm for finding the influence of a node in a graph. It’s called PageRank and is . . .
Please log in to see the full version of this post:
If you haven’t already registered with our Technica Innovations section, please complete the quick registration process now for access: