Kurt, Süreyya Emre2016-08-222016-08-222016-062016-062016-08-04http://hdl.handle.net/11693/32155Cataloged from PDF version of article.Thesis (M.S.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2016.Includes bibliographical references (leaves 34-36).Stratification among humans is a well studied concept that significantly impacts how social connections are shaped. Given that on-line social networks capture social connections among people, similar structure exist in these networks with respect to the presence of social hierarchies. In this thesis we study the problem of finding hidden hierarchies in social networks, in the form of social levels. The problem is motivated by the need for stratification for social advertising. We formulate the problem into dividing the users of a social network into levels, such that three main metrics are minimized: agony induced by the reverse links in the hierarchy, support disorder resulting from users in higher levels having less impact, and support imbalance resulting from users in the same level having diverse impact. We developed several heuristic algorithms to solve the problem at real-world scales. We present an evaluation that showcases the result quality and running time performance of our algorithms on real-world as well as synthetically generated graphs.x, 36 leaves : charts.Englishinfo:eu-repo/semantics/openAccessSocial networkHierarchyThesisB153726