Efficient Shortest Path Estimation in Social Network

Abstract

By the passage of time social networking sites has become a vital part of every one’s life. These sites have played an important role in connecting people from all around the world. These social connections can be studied as graphs. In these graphs the social actors(people) are the nodes and the relationships by which they are connected are the edges. The edges are given weights according to the intensity in their bonds. This research paper focuses on finding out the shortest path between social actors (people) by using Shimbel’s algorithm. Previously researchers have applied Djikstra’s algorithm to find the shortest path of social networks. Shimbel’s algorithm is also used to examine the average distance between the social actors so that an estimate can be made that on average the people connected in social network are how many steps away from each other.