Overlapping communities on social networks : a self-falsifiable hierarchical detection algorithm
Name
1191221606-MIT.pdf
Size
3.11 MB
Format
Adobe PDF
Checksum (MD5)
593065c58d53f467ae5adec9d9727374
Author(s)
Li, Tianyi,Ph.D.Massachusetts Institute of Technology.
Advisor(s)
Hazhir Rahmandad and John Sterman.
Date Issued
2020
Publisher
Massachusetts Institute of Technology
Abstract
Community detection is a central topic in network studies, whereas no community detection algorithm can be optimal for all possible networks; thus it is important to identify whether the algorithm is suitable for a given network. We propose a multi-step algorithmic solution scheme for overlapping community detection based on an advanced label propagation process, which imitates the community formation process on social networks. Our algorithm is parameter-free and is able to reveal the hierarchical order of communities in the graph. The unique property of our solution scheme is self-falsifiability; an automatic quality check of the results is conducted after the detection, and the fitness of the algorithm for the specific network is reported. Extensive experiments show that our algorithm is self-consistent, reliable on networks of a wide range of size and different sorts, and is more robust than existing algorithms on both sparse and large-scale social networks. Results further suggest that our solution scheme may uncover features of networks' intrinsic community structures, which implies that this study builds up potential theoretical ground for future research, beyond expected applications in a wider-scale.
Description
Thesis: S.M. in Management Research, Massachusetts Institute of Technology, Sloan School of Management, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 37-41).
Subjects
Sloan School of Management.
MIT Department
Sloan School of Management
Terms of Use
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
Persistent DSpace Link
