Hyperparametric Influence Minimization: Feature-Driven Intervention Beyond Blocking

In this paper, we investigate the diffusion containment problem through a novel hyperparametric influence minimization model. This model integrates a hyperparametric diffusion framework into the classical influence minimization paradigm, enabling practical, flexible, and fine-grained control over diffusion dynamics via feature interventions on nodes. The objective is to minimize the diffusion from initial seeds, by optimizing the interventions on node feature values. We analyze the challenges and intrinsic properties of hyperparametric influence minimization and derive an upper-bound on the spread, which quantifies the total uncertainty of nodes remaining inactive during the diffusion process. We prove that it exhibits supermodularity in the context of the node selection problem. Based on that, we further design greedy-based algorithms to solve the problem, which outperform the state-of-the-art methods.

Authors

Institutions

Publication Details

Published
2025-08-03
DOI
https://doi.org/10.1145/3711896.3736999
Primary Topic
Data Analysis with R
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hyperparametric Influence Minimization: Feature-Driven Intervention Beyond Blocking

Xiaokui Xiao, Laks V. S. Lakshmanan, Bin Xiang, Bogdan Cautis
Data Analysis with R
article

Hyperparametric Influence Minimization: Feature-Driven Intervention Beyond Blocking

Xiaokui Xiao, Laks V. S. Lakshmanan, Bin Xiang, Bogdan Cautis
article en

Abstract

In this paper, we investigate the diffusion containment problem through a novel hyperparametric influence minimization model. This model integrates a hyperparametric diffusion framework into the classical influence minimization paradigm, enabling practical, flexible, and fine-grained control over diffusion dynamics via feature interventions on nodes. The objective is to minimize the diffusion from initial seeds, by optimizing the interventions on node feature values. We analyze the challenges and intrinsic properties of hyperparametric influence minimization and derive an upper-bound on the spread, which quantifies the total uncertainty of nodes remaining inactive during the diffusion process. We prove that it exhibits supermodularity in the context of the node selection problem. Based on that, we further design greedy-based algorithms to solve the problem, which outperform the state-of-the-art methods.

University of British Columbia (CA), National University of Singapore (SG), Singapore Institute of Technology (SG)
National Research Foundation, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 90%
Data Analysis with R
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.