{"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/learning-policies-for-social-network","title":"Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling","arxiv_id":"1907.11625","date":"2019-07-08","proceeding":null,"authors":["Harshavardhan Kamarthi","Priyesh Vijayan","Bryan Wilder","Balaraman Ravindran","Milind Tambe"],"abstract":"A serious challenge when finding influential actors in real-world social networks is the lack of knowledge about the structure of the underlying network. Current state-of-the-art methods rely on hand-crafted sampling algorithms; these methods sample nodes and their neighbours in a carefully constructed order and choose opinion leaders from this discovered network to maximize influence spread in the (unknown) complete network. In this work, we propose a reinforcement learning framework for network discovery that automatically learns useful node and graph representations that encode important structural properties of the network. At training time, the method identifies portions of the network such that the nodes selected from this sampled subgraph can effectively influence nodes in the complete network. The realization of such transferable network structure based adaptable policies is attributed to the meticulous design of the framework that encodes relevant node and graph signatures driven by an appropriate reward scheme. We experiment with real-world social networks from four different domains and show that the policies learned by our RL agent provide a 10-36% improvement over the current state-of-the-art method.","url_abs":"https://arxiv.org/abs/1907.11625v5","url_pdf":"https://arxiv.org/pdf/1907.11625v5.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":"abstracts"},"code_links":[{"paper_slug":"learning-policies-for-social-network","repo_url":"https://github.com/kage08/graph_sample_rl","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"graph-sampling","task_name":"Graph Sampling"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1907.11625","atlas_url":"https://app.syntology.ai/?focus=1907.11625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11625"}},"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/kage08/graph_sample_rl","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":2,"ran_honours":1,"unverified":11},"by_repo_kind":{"official":{"samples":14,"ran":3,"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":"5a75781caceb9236","entry":"alias_sample","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"ge/alias.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/ge/alias.py","link_basis":"plan_row","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":"5a75781caceb9236"}},{"code_sha256_prefix":"8985b3c4085e0103","entry":"create_alias_table","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"ge/alias.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/ge/alias.py","link_basis":"plan_row","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":"8985b3c4085e0103"}},{"code_sha256_prefix":"8ef536d5c256abeb","entry":"indicator","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"icm.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/icm.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8ef536d5c256abeb"}},{"code_sha256_prefix":"3851cddf27b1234f","entry":"csv_to_graph","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"expts/gendata.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/expts/gendata.py","link_basis":"first_harvest_node","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":"3851cddf27b1234f"}},{"code_sha256_prefix":"08e4f8e636494055","entry":"f_all_influmax_multlinear","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"icm.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/icm.py","link_basis":"first_harvest_node","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":"08e4f8e636494055"}},{"code_sha256_prefix":"02725759d7e0f793","entry":"fanin_init","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"diffpool/utils.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/diffpool/utils.py","link_basis":"first_harvest_node","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":"02725759d7e0f793"}},{"code_sha256_prefix":"249aca583ea3bfdd","entry":"greedy","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"utils.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/utils.py","link_basis":"first_harvest_node","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":"249aca583ea3bfdd"}},{"code_sha256_prefix":"3499b2e151784dcd","entry":"greedy_icm","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"utils.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/utils.py","link_basis":"first_harvest_node","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":"3499b2e151784dcd"}},{"code_sha256_prefix":"0e46fd92680f3062","entry":"nmf_embed","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"expts/graphembed.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/expts/graphembed.py","link_basis":"first_harvest_node","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":"0e46fd92680f3062"}},{"code_sha256_prefix":"e8fd33e59b22c589","entry":"nmf_embed1","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"expts/graphembed.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/expts/graphembed.py","link_basis":"first_harvest_node","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":"e8fd33e59b22c589"}},{"code_sha256_prefix":"6727fbd13179d326","entry":"node_embed","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"expts/graphembed.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/expts/graphembed.py","link_basis":"first_harvest_node","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":"6727fbd13179d326"}},{"code_sha256_prefix":"56d4fa85a26c8c89","entry":"projection_simplex_sort","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"utils.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/utils.py","link_basis":"first_harvest_node","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":"56d4fa85a26c8c89"}},{"code_sha256_prefix":"86dd7336e2145c1a","entry":"random_sbm","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"expts/gengraph.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/expts/gengraph.py","link_basis":"first_harvest_node","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":"86dd7336e2145c1a"}},{"code_sha256_prefix":"22daae4291d1af18","entry":"sample_live_icm","repo":"kage08/graph_sample_rl","repo_kind":"official","path":"icm.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/icm.py","link_basis":"first_harvest_node","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":"22daae4291d1af18"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}