Searcharxiv⌕ Search

arXiv · 2611.15949

Efficient Influence Minimization via Source-Integrated Sampling

Abstract

Influence minimization by node blocking is a fundamental problem in graph data management that seeks a small set of vertices whose removal minimizes the expected spread from a fixed source set. It supports decisions about where to intervene in large interaction networks to control harmful propagation, such as the spread of rumors and infectious diseases. Under the Independent Cascade (IC) model, selecting blockers requires comparing a large number of candidate sets, and estimating their effects on propagation can be costly. We propose SIG (Source-Integrated Greedy), a sampling framework for efficiently finding high-quality approximate solutions. Our key idea is to group the possible sets of neighbors directly activated by the sources according to their effects on blocker selection. SIG represents these groups in a compact weighted tree and computes their probabilities directly, allowing each sample to account for all source outcomes without enumerating them. We prove that SIG produces unbiased estimates of the lower-bound objective without increasing variance for fixed blocking plans, and establish a high-probability quality guarantee through independent validation. Extensive experiments on real-world networks show that SIG has the lowest mean total running time in all main comparisons, with speedups of up to 583x over the fastest baseline. SIG produces solutions competitive with those of prior methods and achieves the highest influence reduction in multiple settings, including on many of the largest networks, where several baselines exceed the runtime limit. Additional experiments show that SIG maintains consistently low running times as graph size and the blocking budget increase, while delivering stronger blocking solutions at larger budgets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jingbang Chen, Junyao Wang. 2026-11-11. Efficient Influence Minimization via Source-Integrated Sampling. https://searcharxiv.com/abs/2611.15949

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Network sampling: a comparative review

Network sampling is essential for the study of real world systems, since access to the topological structure and dynamical characteristics of a complex system is usually infeasible, and can also prove computationally intractable for large and dense networks. However, the field still lacks systematic methodologies that allow a procedural analysis of sampling plans for connected data. Hence, this study aims to compare network sampling methods through the usage of multivariate statistical analysis and machine learning techniques that are anchored in network metrics' estimation of synthetic and real-world networks. It was demonstrated that no single sampling strategy dominates both cases, although Forest fire and Frontier sampling have presented the most consistent performance across all topologies investigated. The impact of each structural property of these networks for principal component analysis and classification results were also discussed, with consistent pattern groups seen for both data types. Transfer learning aimed at real-world network identification has also demonstrated that realistic structural connections can be correlated to well-known network models through the usage of sampled subgraphs' properties for model training, providing an avenue to real-world network characterization through sampling methodologies.

cs.SI↗

Manufactured Authenticity: How Behavioral Signals Are Produced and Misread in Online Markets

Online platforms increasingly ask users to infer credibility from behavioral signals whose production conditions are opaque. We introduce manufactured authenticity: the platform-mediated production of observable activity that interfaces invite users to read as organic participation. Using 996,834 cryptocurrency tokens and 50,895 creator wallets from Pump.fun, a Solana-based token launchpad, we examine how legitimacy signals are produced in an automation-enabled online market. We identify four production strategies (high-velocity launching, passive launching, template-content creation, and organic-style creation) that generate distinct but interface-similar cues of activity, narrative plausibility, and participation. High-velocity and template-content strategies emerge as alternatives rather than cumulative layers: the former produces activity at scale, while the latter produces descriptions associated with higher reply engagement. Yet visible engagement does not imply broader diffusion: template-like content attracts replies without greater ownership dispersion, and tokens associated with non-organic production strategies exhibit more concentrated investor holdings than organic-style tokens. We argue that platform governance should move beyond detecting manipulation toward making signal provenance legible. We propose authenticity disclosure as a design approach for surfacing production conditions without requiring definitive claims about automation, AI authorship, or actor intent.

cs.SI↗

Spatial Price Formation in Transport Networks: A Variational Approach

This paper formulates a model of spatial price formation in a closed regional economy, with finitely many production nodes and finitely many demand nodes embedded in a continuous geographic domain. Transportation costs depend on the geometry of the region and on an underlying network of feasible connections. Prices are modeled as a spatial field constrained by arbitrage and transport feasibility. The equilibrium price system is characterized by a variational problem. A second minimization selects an equilibrium-compatible price field with minimum spatial energy and permits the use of Euler--Lagrange methods. The framework clarifies what observed prices and quantities reveal about demand, and uses known transport costs to bound unobserved prices and exclude directed arcs from equilibrium shipments. A five-node example illustrates equilibrium, alternative shipment patterns, and the information supplied by partial price observations. We give a numerical procedure for planar domains and outline an extension to spherical domains.

cs.SI↗