Who’s the most influential in a social graph? New software recognizes key influencers faster than ever
- Date:
- September 7, 2012
- Source:
- Georgia Institute of Technology
- Summary:
- Determining the most influential person on a social media network is complex. Thousands of users are interacting about a single subject at the same time. New people are constantly joining the streaming conversation. Researchers have developed a new algorithm that quickly determines betweenness centrality for streaming graphs. The algorithm can identify influencers as information changes within a network.
- Share:
At an airport, many people are essential for planes to take off. Gate staffs, refueling crews, flight attendants and pilots are in constant communication with each other as they perform required tasks. But it's the air traffic controller who talks with every plane, coordinating departures and runways. Communication must run through her in order for an airport to run smoothly and safely.
In computational terms, the air traffic controller is the "betweenness centrality," the most connected person in the system. In this example, finding the key influencer is easy because each departure process is nearly the same.
Determining the most influential person on a social media network (or, in computer terms, a graph) is more complex. Thousands of users are interacting about a single subject at the same time. New people (known computationally as edges) are constantly joining the streaming conversation.
Georgia Tech has developed a new algorithm that quickly determines betweenness centrality for streaming graphs. The algorithm can identify influencers as information changes within a network. The first-of-its-kind streaming tool was presented this week by Computational Science and Engineering Ph.D. candidate Oded Green at the Social Computing Conference in Amsterdam.
"Unlike existing algorithms, our system doesn't restart the computational process from scratch each time a new edge is inserted into a graph," said College of Computing Professor David Bader, the project's leader. "Rather than starting over, our algorithm stores the graph's prior centrality data and only does the bare minimal computations affected by the inserted edges."
In some cases, betweenness centrality can be computed more than 100 times faster using the Georgia Tech software. The open source software will soon be available to businesses.
Bader, the Institute's executive director for high performance computing, says the technology has wide-ranging applications. For instance, advertisers could use the software to identify which celebrities are most influential on Twitter or Facebook, or both, during product launches.
"Despite a fragmented social media landscape, data analysts would be able to use the algorithm to look at each social media network and mark inferences about a single influencer across these different platforms," said Bader.
As another example, the algorithm could be used for traffic patterns during a wreck or traffic jam. Transportation officials could quickly determine the best new routes based on gradual side-street congestion.
The accepted paper was co-authored by Electrical and Computer Engineering Ph.D. candidate Rob McColl.
Story Source:
Materials provided by Georgia Institute of Technology. Note: Content may be edited for style and length.
Cite This Page: