惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

WordPress大学
WordPress大学
A
About on SuperTechFans
小众软件
小众软件
Hugging Face - Blog
Hugging Face - Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园 - 叶小钗
博客园 - 聂微东
博客园 - Franky
Apple Machine Learning Research
Apple Machine Learning Research
罗磊的独立博客
量子位
博客园 - 三生石上(FineUI控件)
Recent Announcements
Recent Announcements
The GitHub Blog
The GitHub Blog
B
Blog RSS Feed
T
The Blog of Author Tim Ferriss
GbyAI
GbyAI
云风的 BLOG
云风的 BLOG
Last Week in AI
Last Week in AI
宝玉的分享
宝玉的分享
B
Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Stack Overflow Blog
Stack Overflow Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
The effects of individual versus community-influenced iso...
Shirshendu Chatterjee, David Sivakoff, Matthew Wascher · 2025-12-06 · via math updates on arXiv.org

The contact process, or the SIS epidemic model, is a continuous-time Markov process used to model the spread of a recurring infection on a graph. Each vertex is either healthy or infected, and each infected vertex independently infects each of its healthy neighbors at rate $λ$ and recovers at rate $1$. We study the contact process in the presence of additional intervention measures by introducing a third possible state for vertices, which we call isolated. Vertices may enter the isolated state either because of individual decisions or due to community-influenced decisions, which leads to two distinct models that we call the isolation model and the vigilance model, respectively. In the isolation model, infected vertices self-isolate at rate $α$. In the vigilance model, each healthy vertex causes each of its infected neighbors to isolate at rate $α$. Unlike the classical contact process, these models lack the key features of attractiveness and existence of a dual, which makes analyzing them more challenging. We study the persistence times of the infection on large, finite, random graphs with heavy-tailed degree distributions. We show that the infection in the isolation model persists for at least stretched exponential time in the size of the graph for all values of $α$ and $λ$. By contrast, in the vigilance model, for every fixed $α$ the persistence time of the infection exhibits a phase transition in $λ$: for small $λ$ the infection persists for at most a linear time in the size of the graph, while for large $λ$ the infection persists exponentially long. As a corollary of our main results we show that for any $λ, α>0$ the persistence time of the SIRS model on the configuration model having $n$ vertices starting from all vertices infected is at least $\exp(n^{1-η})$ with high probability for any $η>0$.