Analysis of Effective Algorithms In Social Networks

Please enable javascript in your browser.

Nikparto, Nastaran | 2011

1633 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 42402 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Safari, Mohammad Ali
Abstract:
A social network is a social structure made up of individuals (or organizations) called ”nodes”, which are tied by one or more specific types of interdependency. These networks are new forms of distributed larg media which actually plays a critical role in distributing information and news among the people. because of the size and autonomos aspect of these kind od medias, taking control of them seems impossible. with the best hope we could think of some ways to detect information cascades through network.for example we could select a set of nodes as sensor inorder to detect information cascades as effectively as possible. in this thesis we studied cascade detection problem in scenario based model. in this model we are given some cascade scenarios in a network and asked to place k sensors in network inorder to minimize maximum of scenarios’ detection time. we showed that approximating this problem with single factor is NP-hard and suggest a bifactor algorithm for it which is the possible. we also study some other forms of this problem by assuming or relaxing some constraints
Keywords:
Social Networks ; Approximate Algorithm ; Social Influence Spread ; Outbreak Detection