{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/firmtruss-community-search-in-multilayer","title":"FirmTruss Community Search in Multilayer Networks","arxiv_id":"2205.00742","date":"2022-05-02","proceeding":null,"authors":["Ali Behrouz","Farnoosh Hashemi","Laks V. S. Lakshmanan"],"abstract":"In applications such as biological, social, and transportation networks, interactions between objects span multiple aspects. For accurately modeling such applications, multilayer networks have been proposed. Community search allows for personalized community discovery and has a wide range of applications in large real-world networks. While community search has been widely explored for single-layer graphs, the problem for multilayer graphs has just recently attracted attention. Existing community models in multilayer graphs have several limitations, including disconnectivity, free-rider effect, resolution limits, and inefficiency. To address these limitations, we study the problem of community search over large multilayer graphs. We first introduce FirmTruss, a novel dense structure in multilayer networks, which extends the notion of truss to multilayer graphs. We show that FirmTrusses possess nice structural and computational properties and bring many advantages compared to the existing models. Building on this, we present a new community model based on FirmTruss, called FTCS, and show that finding an FTCS community is NP-hard. We propose two efficient 2-approximation algorithms, and show that no polynomial-time algorithm can have a better approximation guarantee unless P = NP. We propose an index-based method to further improve the efficiency of the algorithms. We then consider attributed multilayer networks and propose a new community model based on network homophily. We show that community search in attributed multilayer graphs is NP-hard and present an effective and efficient approximation algorithm. Experimental studies on real-world graphs with ground-truth communities validate the quality of the solutions we obtain and the efficiency of the proposed algorithms.","url_abs":"https://arxiv.org/abs/2205.00742v2","url_pdf":"https://arxiv.org/pdf/2205.00742v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"firmtruss-community-search-in-multilayer","repo_url":"https://github.com/joint-em/ftcs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2205.00742","atlas_url":"https://app.syntology.ai/?focus=2205.00742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00742"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/joint-em/ftcs","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":7,"unverified":1},"by_repo_kind":{"official":{"samples":8,"ran":7,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"a8ef299f07171313","entry":"FirmCore_k","repo":"joint-em/ftcs","repo_kind":"official","path":"Code/FirmCore/FirmCore.py","file_url":"https://github.com/joint-em/ftcs/blob/HEAD/Code/FirmCore/FirmCore.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a8ef299f07171313"}},{"code_sha256_prefix":"dcb5afd14227fc89","entry":"density","repo":"joint-em/ftcs","repo_kind":"official","path":"Code/Utils/density.py","file_url":"https://github.com/joint-em/ftcs/blob/HEAD/Code/Utils/density.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"dcb5afd14227fc89"}},{"code_sha256_prefix":"7113f02270dcca67","entry":"density_log","repo":"joint-em/ftcs","repo_kind":"official","path":"Code/Utils/density.py","file_url":"https://github.com/joint-em/ftcs/blob/HEAD/Code/Utils/density.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7113f02270dcca67"}},{"code_sha256_prefix":"cb1120ddf287f023","entry":"get_d_hub_neighborhood","repo":"joint-em/ftcs","repo_kind":"official","path":"Code/Utils/Distance.py","file_url":"https://github.com/joint-em/ftcs/blob/HEAD/Code/Utils/Distance.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cb1120ddf287f023"}},{"code_sha256_prefix":"99db67e0c5f78ccd","entry":"get_distances","repo":"joint-em/ftcs","repo_kind":"official","path":"Code/Utils/Distance.py","file_url":"https://github.com/joint-em/ftcs/blob/HEAD/Code/Utils/Distance.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"99db67e0c5f78ccd"}},{"code_sha256_prefix":"9d1aecf000141b7a","entry":"marginal_gain","repo":"joint-em/ftcs","repo_kind":"official","path":"Code/Homophily/Homophily.py","file_url":"https://github.com/joint-em/ftcs/blob/HEAD/Code/Homophily/Homophily.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9d1aecf000141b7a"}},{"code_sha256_prefix":"5fcad4b6caeb295d","entry":"p_mean","repo":"joint-em/ftcs","repo_kind":"official","path":"Code/Homophily/Homophily.py","file_url":"https://github.com/joint-em/ftcs/blob/HEAD/Code/Homophily/Homophily.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5fcad4b6caeb295d"}},{"code_sha256_prefix":"94d7e2d119c792b0","entry":"FirmTruss_k_index","repo":"joint-em/ftcs","repo_kind":"official","path":"Code/FirmTruss/FirmTruss.py","file_url":"https://github.com/joint-em/ftcs/blob/HEAD/Code/FirmTruss/FirmTruss.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"94d7e2d119c792b0"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}