Community Quality and Influence Maximization: An Empirical Study

• URL: http://arxiv.org/abs/2512.03095v1
• Date: Mon, 01 Dec 2025 09:59:04 GMT
• Title: Community Quality and Influence Maximization: An Empirical Study
• Authors: Motaz Ben Hassine,
• Abstract summary: Social networks play a vital role in applications such as viral marketing, epidemiology, product recommendation, and counter-terrorism.<n>A common approach, Cascade seed nodes, by first detecting disjoint communities and subsequently selecting representative nodes from these communities.<n>But whether the quality of detected communities consistently identifies the spread of influence under the Independent model remains unclear.<n>This paper addresses this question by extending a disjoint community detection method, termed $$-Hierarchical Clustering, to the influence problem under the Independent model.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Influence maximization in social networks plays a vital role in applications such as viral marketing, epidemiology, product recommendation, opinion mining, and counter-terrorism. A common approach identifies seed nodes by first detecting disjoint communities and subsequently selecting representative nodes from these communities. However, whether the quality of detected communities consistently affects the spread of influence under the Independent Cascade model remains unclear. This paper addresses this question by extending a previously proposed disjoint community detection method, termed $α$-Hierarchical Clustering, to the influence maximization problem under the Independent Cascade model. The proposed method is compared with an alternative approach that employs the same seed selection criteria but relies on communities of lower quality obtained through standard Hierarchical Clustering. The former is referred to as Hierarchical Clustering-based Influence Maximization, while the latter, which leverages higher-quality community structures to guide seed selection, is termed $α$-Hierarchical Clustering-based Influence Maximization. Extensive experiments are performed on multiple real-world datasets to assess the effectiveness of both methods. The results demonstrate that higher-quality community structures substantially improve information diffusion under the Independent Cascade model, particularly when the propagation probability is low. These findings underscore the critical importance of community quality in guiding effective seed selection for influence maximization in complex networks.

Related papers

• New Recipe for Semi-supervised Community Detection: Clique Annealing under Crystallization Kinetics [6.980148661624593]
  We propose CLique ANNealing (CLANN), which integrates kinetics concepts to community detection.<n>In particular, we liken community detection to identifying a crystal subgrain (core) that expands into a complete grain (community) through a process similar to annealing.<n>In experiments on textbf43 different network settings, CLANN outperforms state-of-the-art methods across multiple real-world datasets.
  arXiv  Detail & Related papers  (2025-04-22T14:17:15Z)
• Cost-Effective Community-Hierarchy-Based Mutual Voting Approach for Influence Maximization in Complex Networks [54.366995393644586]
  Real-world usually have high requirements on the balance between time and accuracy of influential nodes identification. This article proposes a novel approach called Cost-Effective Community-Hierarchy-Based Mutual Voting for influence in complex networks. The proposed approach outperforms 16 state-of-the-art techniques on the balance between time complexity and accuracy of influential nodes identification.
  arXiv  Detail & Related papers  (2024-09-21T06:32:28Z)
• Be Aware of the Neighborhood Effect: Modeling Selection Bias under Interference [50.95521705711802]
  Previous studies have focused on addressing selection bias to achieve unbiased learning of the prediction model. This paper formally formulates the neighborhood effect as an interference problem from the perspective of causal inference. We propose a novel ideal loss that can be used to deal with selection bias in the presence of neighborhood effect.
  arXiv  Detail & Related papers  (2024-04-30T15:20:41Z)
• GCC: Generative Calibration Clustering [55.44944397168619]
  We propose a novel Generative Clustering (GCC) method to incorporate feature learning and augmentation into clustering procedure. First, we develop a discrimirative feature alignment mechanism to discover intrinsic relationship across real and generated samples. Second, we design a self-supervised metric learning to generate more reliable cluster assignment.
  arXiv  Detail & Related papers  (2024-04-14T01:51:11Z)
• Pack and Measure: An Effective Approach for Influence Propagation in Social Networks [0.3222802562733786]
  The Influence Maximization problem under the Independent Cascade model (IC) is considered. New seed-set selection methods are introduced based on the notions of a $d$-packing and centrality.
  arXiv  Detail & Related papers  (2023-12-31T15:51:33Z)
• Community-Based Hierarchical Positive-Unlabeled (PU) Model Fusion for Chronic Disease Prediction [35.76481037888834]
  We present a novel Positive-Unlabeled Learning Tree (PUtree) algorithm. PUtree is designed to take into account communities such as different age or income brackets, in tasks of chronic disease prediction. We demonstrate the superior performance of PUtree as well as its variants on two benchmarks and a new diabetes-prediction dataset.
  arXiv  Detail & Related papers  (2023-09-06T22:16:58Z)
• Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization [53.11458949694947]
  We consider an adaptive version of content-dependent online influence problem where seed nodes are sequentially activated based on realtime feedback. Our algorithm maintains a network model estimate and selects seed adaptively, exploring the social network while improving the optimal policy optimistically.
  arXiv  Detail & Related papers  (2022-06-29T18:17:28Z)
• Reinforcement Learning with Heterogeneous Data: Estimation and Inference [84.72174994749305]
  We introduce the K-Heterogeneous Markov Decision Process (K-Hetero MDP) to address sequential decision problems with population heterogeneity. We propose the Auto-Clustered Policy Evaluation (ACPE) for estimating the value of a given policy, and the Auto-Clustered Policy Iteration (ACPI) for estimating the optimal policy in a given policy class. We present simulations to support our theoretical findings, and we conduct an empirical study on the standard MIMIC-III dataset.
  arXiv  Detail & Related papers  (2022-01-31T20:58:47Z)
• Influence Maximization Under Generic Threshold-based Non-submodular Model [1.5780411262109524]
  Concept of social influence is coined, where the goal is to select a number of most influential nodes (seed nodes) from a social network so that they can jointly trigger the maximal influence diffusion. In this paper, we propose seed selection strategies using network graphical in a generalized threshold-based model, called influence barricade model, which is non-submodular. To the best of our knowledge, this is the first graph-based approach that directly tackles non-submodular influence.
  arXiv  Detail & Related papers  (2020-12-18T16:14:49Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)

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.