University of Illinois Urbana-Champaign

Dynamic partitioning of social networks

Yuan, Mindi

Content Files
Mindi_Yuan.pdf

Permalink

https://hdl.handle.net/2142/42231

Description

Title
Dynamic partitioning of social networks
Author(s)
Yuan, Mindi
Issue Date
2013-02-03T19:28:40Z
Director of Research (if dissertation) or Advisor (if thesis)
Lu, Yi
Department of Study
Electrical & Computer Eng
Discipline
Electrical & Computer Engr
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Date of Ingest
2013-02-03T19:28:40Z
Keyword(s)
  • Social networks
  • Partitioning
  • Online algorithms
Abstract
In this thesis, I study the problem of dynamic partitioning of online social networks (OSN). The problem is practically important since it lays the foundation of many applications. If OSN users are treated as vertices and their connections, like friendships or conversations, as edges, social networks can be represented as graphs. Partitioning the OSN graph itself is difficult as its power-law degree distribution leads to many cross-partition edges. Moreover, unlike traditional graphs, which are more static, OSN graphs often evolve significantly due to dynamic changes in social interactions and hence the social network can be viewed as a stream of graphs sampled at different time. Therefore, it is desirable to partition the graphs not only in the spatial dimension, but also in the time dimension, which makes the problem more difficult. However, these evolutions, like the changing of conversation frequency between two friends, are not totally random. Thus if these evolutions can be captured, predicted, and used properly, they will help us achieve better partitioning. As a result, we propose to make use of past graph evolution information and encode them into edge weights. We develop two corresponding methods: (1) weight the edges based on access frequency, assuming users involved in frequent conversations are more likely to stay in the same partition; or (2) weight the edges based on access recency, assuming a graph consisting mostly of newest edges will reflect the current status of the network. We then design two separate algorithms based on these two definitions of edge weights. Simulations show that each method captures desired graph characteristics respectively and achieves dynamic partitioning.
Graduation Semester
2012-12
Permalink
http://hdl.handle.net/2142/42231
Copyright and License Information
Copyright 2012 Mindi Yuan

Owning Collections

Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at Illinois
Dissertations and Theses - Electrical and Computer Engineering
Dissertations and Theses in Electrical and Computer Engineering