A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence

• URL: http://arxiv.org/abs/2512.23973v1
• Date: Tue, 30 Dec 2025 04:05:21 GMT
• Title: A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence
• Authors: Eliot W. Robson, Abhishek K. Umrawal,
• Abstract summary: Influence Maximization (IM) seeks to identify a small set of seed nodes in a social network to expected information.<n>We introduce Community-IM++, a framework that prioritizes social networks based on community-based diffusion.
• Score: 1.160208922584163
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Influence Maximization (IM) seeks to identify a small set of seed nodes in a social network to maximize expected information spread under a diffusion model. While community-based approaches improve scalability by exploiting modular structure, they typically assume independence between communities, overlooking inter-community influence$\unicode{x2014}$a limitation that reduces effectiveness in real-world networks. We introduce Community-IM++, a scalable framework that explicitly models cross-community diffusion through a principled heuristic based on community-based diffusion degree (CDD) and a progressive budgeting strategy. The algorithm partitions the network, computes CDD to prioritize bridging nodes, and allocates seeds adaptively across communities using lazy evaluation to minimize redundant computations. Experiments on large real-world social networks under different edge weight models show that Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime, while outperforming Community-IM and degree heuristics across budgets and structural conditions. These results demonstrate the practicality of Community-IM++ for large-scale applications such as viral marketing, misinformation control, and public health campaigns, where efficiency and cross-community reach are critical.

Related papers

• Event-Triggered Gossip for Distributed Learning [61.70659996356528]
  We develop a new event-triggered gossip framework for distributed learning to reduce inter-node communication.<n>We analyze bf71.61% with only a marginal performance loss, compared with the conventional full-text-of-the-art distributed learning methods.
  arXiv  Detail & Related papers  (2026-02-22T10:13:43Z)
• Federated Attention: A Distributed Paradigm for Collaborative LLM Inference over Edge Networks [63.541114376141735]
  Large language models (LLMs) are proliferating rapidly at the edge, delivering intelligent capabilities across diverse application scenarios.<n>However, their practical deployment in collaborative scenarios confronts fundamental challenges: privacy vulnerabilities, communication overhead, and computational bottlenecks.<n>We propose Federated Attention (FedAttn), which integrates the federated paradigm into the self-attention mechanism.
  arXiv  Detail & Related papers  (2025-11-04T15:14:58Z)
• Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion [5.009105844450518]
  We propose a novel Topological and Attributive Similarity-based Community detection (TAS-Com) method.<n>TAS-Com exploits the highly effective and scalable Leiden attribute algorithm to detect community structures with global optimal modularity.<n>We show that TAS-Com can significantly outperform several state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2025-05-15T11:53:33Z)
• MF-LLM: Simulating Population Decision Dynamics via a Mean-Field Large Language Model Framework [53.82097200295448]
  Mean-Field LLM (MF-LLM) is first to incorporate mean field theory into social simulation.<n>MF-LLM models bidirectional interactions between individuals and the population through an iterative process.<n> IB-Tune is a novel fine-tuning method inspired by the Information Bottleneck principle.
  arXiv  Detail & Related papers  (2025-04-30T12:41:51Z)
• Influence Maximization via Graph Neural Bandits [54.45552721334886]
  We set the IM problem in a multi-round diffusion campaign, aiming to maximize the number of distinct users that are influenced. We propose the framework IM-GNB (Influence Maximization with Graph Neural Bandits), where we provide an estimate of the users' probabilities of being influenced.
  arXiv  Detail & Related papers  (2024-06-18T17:54:33Z)
• Fair Information Spread on Social Networks with Community Structure [2.9613974659787132]
  Influence maximiza- tion (IM) algorithms aim to identify individuals who will generate the greatest spread through the social network if provided with information. This work relies on fitting a model to the social network which is then used to determine a seed allocation strategy for optimal fair information spread.
  arXiv  Detail & Related papers  (2023-05-15T16:51:18Z)
• A Spreader Ranking Algorithm for Extremely Low-budget Influence Maximization in Social Networks using Community Bridge Nodes [12.691905338833372]
  The aim of Influence Maximisation (IM) is to identify certain nodes in the network which can help maximize the spread of certain information. We propose a community structures-based approach, which employs a K-Shell algorithm in order to generate a score for the connections between seed nodes and communities. We choose the Independent Cascade (IC) model to simulate information spread and evaluate it on four evaluation metrics.
  arXiv  Detail & Related papers  (2022-11-17T16:53:47Z)
• A Community-Aware Framework for Social Influence Maximization [40.842329580198324]
  We consider the Influence Maximization (IM) problem: 'if we can try to convince a subset of individuals in a social network to adopt a new product or innovation, and the goal is to trigger a large cascade of further adoptions, which set of individuals should we target' We propose a community-aware divide-and-conquer strategy that involves (i) learning the inherent community structure of the social network, (ii) generating candidate solutions by solving the influence problem for each community, and (iii) selecting the final set of individuals from the candidate solutions using a novel progressive budgeting scheme.
  arXiv  Detail & Related papers  (2022-07-18T20:43:17Z)
• Enhance Ambiguous Community Structure via Multi-strategy Community Related Link Prediction Method with Evolutionary Process [7.239725647907488]
  We design a new community attribute based link prediction strategy HAP. This paper aims at providing a community enhancement measure through adding links to clarify ambiguous community structures. The experimental results on twelve real-world datasets with ground truth community indicate that the proposed link prediction method outperforms other baseline methods.
  arXiv  Detail & Related papers  (2022-04-28T06:24:16Z)
• Contingency-Aware Influence Maximization: A Reinforcement Learning Approach [52.109536198330126]
  influence (IM) problem aims at finding a subset of seed nodes in a social network that maximize the spread of influence. In this study, we focus on a sub-class of IM problems, where whether the nodes are willing to be the seeds when being invited is uncertain, called contingency-aware IM. Despite the initial success, a major practical obstacle in promoting the solutions to more communities is the tremendous runtime of the greedy algorithms.
  arXiv  Detail & Related papers  (2021-06-13T16:42:22Z)
• Communication Efficient Distributed Learning with Censored, Quantized, and Generalized Group ADMM [52.12831959365598]
  We propose a communication-efficiently decentralized machine learning framework that solves a consensus optimization problem defined over a network of inter-connected workers. The proposed algorithm, Censored and Quantized Generalized GADMM, leverages the worker grouping and decentralized learning ideas of Group Alternating Direction Method of Multipliers (GADMM) Numerical simulations corroborate that CQ-GGADMM exhibits higher communication efficiency in terms of the number of communication rounds and transmit energy consumption without compromising the accuracy and convergence speed.
  arXiv  Detail & Related papers  (2020-09-14T14:18:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.