Searcharxiv⌕ Search

arXiv · 2610.07926

Target-Aware Network Dismantling with Limited Budgets

Abstract

During epidemics, limited resources dictate critical decisions about whom to isolate or monitor. Conventional public health strategies intuitively prioritize known infected individuals and their immediate contacts. Here, we reveal that this contact-centric approach is fundamentally suboptimal under realistic resource constraints. By formulating this challenge as target-aware network dismantling, we uncover a counter-intuitive, budget-dependent intervention transition. Generating-function analysis demonstrates that when intervention budgets are scarce, isolating structurally central individuals, rather than the immediate neighbours of the infected, protects a vastly larger population. The conventional neighbour-targeting strategy only becomes optimal as available resources increase. Because this critical transition point shifts dynamically with the intervention budget, network topology, and spatial distribution of infections, static strategies inevitably fail. To overcome this, we develop Risk-Aware Isolation Learning (RAIL), a deep reinforcement learning framework that adaptively selects optimal interventions based on the evolving residual network. Across diverse synthetic and real-world networks, RAIL consistently maximizes population protection and suppresses outbreak spread. Ultimately, our findings challenge prevailing epidemiological intuitions, establishing a generalizable framework for adaptive interventions against localized risks in public health and other complex systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiaqi Song, Fei Jing, Wenjie Huang, Xingqin Qi, Qingpeng Zhang. 2026-10-06. Target-Aware Network Dismantling with Limited Budgets. https://arxiv.org/abs/2610.07926

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A local eigenvector centrality

Eigenvector centrality is an established measure of global connectivity, from which the importance and influence of nodes can be inferred. We introduce local eigenvector centrality (LEC), a scale-adaptive extension that integrates local and global connectivity into a single centrality measure. LEC identifies a topologically relevant mesoscopic scale for community-level centrality assessment, informed by prominent eigengaps, and combines information from the associated eigenvectors, via the Euclidean norm, to yield a centrality that reflects community-driven node influence. Networks with known community structures are employed to demonstrate that LEC closely reproduces eigenvector centrality for each community in isolation. Discrepancies between these measures are shown to be attributable to the global connectivity of affected nodes. LEC therefore provides a principled integration of community-level and global notions of node importance. Comparisons with PageRank and Katz centrality demonstrate that damping-based approaches do not recover community-scale centrality as effectively as LEC.

cs.SI↗

Recommender system in X inadvertently profiles ideological positions of users

Several data protection laws restrict processing that reveals political opinions, irrespective of the controller's intent. Whether recommender systems do so as a by-product of optimizing relevance has not been measured. From 2.5 million ``Who to Follow'' recommendations shown to 682 volunteers in France, we reconstructed an approximation of the embedding used by X's recommender for 26,509 accounts, computing survey-calibrated ideology scores. One direction in this embedding orders users by Left-Right position (Pearson rho = 0.887), distinct from directions tracking age, gender or popularity. We show this scale exists and affects the recommendations computed from the embedding. Removing it diversified recommendations at a limited cost in accuracy. We document a consequential form of emergent political representation that current definitions of profiling do not clearly address.

cs.SI↗

Scalable detection of higher-order interactions in network data

Complex systems are routinely measured and represented through pairwise networks, even when the underlying interactions involve more than two units at once. Recovering this latent hypergraph structure from pairwise measurements is a fundamental inverse problem, but as the space of candidate hyperedges grows exponentially with system size, scalable hypergraph reconstruction at arbitrary interaction orders is out of reach for existing methods. Here we cast hypergraph reconstruction as a local signal-to-noise discrimination problem and use this locality to build a fast algorithm that reconstructs hypergraphs up to any interaction order. Across diverse synthetic and real-world systems our method achieves a high recovery accuracy of latent hypergraph structure while reconstructing hypergraphs up to orders of magnitude more quickly than current approaches. Our approach also yields an information-theoretic detectability boundary that sharply predicts which latent hyperedges are recoverable from pairwise measurements.

cs.SI↗