{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/126965"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/126965","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Overlapping communities on social networks : a self-falsifiable hierarchical detection algorithm","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Li, Tianyi,Ph.D.Massachusetts Institute of Technology."],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Sloan School of Management","school":null,"contributors":[],"advisors":["Hazhir Rahmandad and John Sterman."],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020","date_published":"2020","updated_at":"2026-07-22T22:20:52Z","subjects":["Sloan School of Management."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/126965","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Hazhir Rahmandad and John Sterman."]},{"key":"dc:contributor.department","label":"Department","values":["Sloan School of Management","Sloan"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Sloan School of Management."]},{"key":"dc:creator","label":"Author","values":["Li, Tianyi,Ph.D.Massachusetts Institute of Technology."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-09-03T16:45:43Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-09-03T16:45:43Z"]},{"key":"dc:date.issued","label":"Date","values":["2020"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Sloan School of Management."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/126965"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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)."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M. in Management Research"]},{"key":"dc:title","label":"Title","values":["Overlapping communities on social networks : a self-falsifiable hierarchical detection algorithm"]}]}],"canonical_facts":{"dc:contributor.advisor":["Hazhir Rahmandad and John Sterman."],"dc:contributor.department":["Sloan School of Management","Sloan"],"dc:contributor.other":["Sloan School of Management."],"dc:creator":["Li, Tianyi,Ph.D.Massachusetts Institute of Technology."],"dc:date.accessioned":["2020-09-03T16:45:43Z"],"dc:date.available":["2020-09-03T16:45:43Z"],"dc:date.issued":["2020"],"dc: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)."],"dc:description.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."],"dc:description.degree":["S.M. in Management Research"],"dc:identifier.uri":["https://hdl.handle.net/1721.1/126965"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Sloan School of Management."],"dc:title":["Overlapping communities on social networks : a self-falsifiable hierarchical detection algorithm"],"dc:type":["Thesis"],"thesis:degree_name":["Master"]},"updated_at":"2026-07-22T22:20:52Z"}