SCS Undergraduate Thesis Topics
|Daniel Schafer||Luis von Ahn||Finding Accurate Models of Social Graphs|
Studies into the graph structure of social networks have revealed many interesting properties, including their tendency towards clustering and the small world eo,ect. The original random graph model proposed by Erdos and Renyi does not exhibit these properties, prompting investigation into other algorithms to construct random graphs. Using large data sets, such as the 65 million node data set recently collected from Twitter. I determine what properties actual social network graphs have that the random graph algorithms do not accurately model, and present methods of producing random graphs that correctly model those properties.