Files in this item

FilesDescriptionFormat

application/pdf

application/pdfMindi_Yuan.pdf (2MB)
(no description provided)PDF

Description

Title:Dynamic partitioning of social networks
Author(s):Yuan, Mindi
Advisor(s):Lu, Yi
Department / Program:Electrical & Computer Eng
Discipline:Electrical & Computer Engr
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(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.
Issue Date:2013-02-03
URI:http://hdl.handle.net/2142/42231
Rights Information:Copyright 2012 Mindi Yuan
Date Available in IDEALS:2013-02-03
Date Deposited:2012-12


This item appears in the following Collection(s)

Item Statistics