Searcharxiv⌕ Search

arXiv · 2611.12920

Oscillations in two-stage contagion on networks: contagion structure, turnover and connectivity

Abstract

Two-stage contagion describes processes, such as the adoption of an opinion or of a technological novelty, in which an individual must be exposed to an adopter twice before adopting. With demographic turnover these processes can generate waves of adoption and abandonment. We study these oscillations in a two-stage contagion model with turnover through a reservoir of inactive individuals and a small rate of spontaneous activation, and report four main findings. (i) In the mean-field description the oscillations are born at a supercritical Hopf bifurcation and require a predominantly two-stage contagion (first-contact adoption probability $Q\lesssim0.17$) and a slow turnover; spontaneous activation acts as a perturbation that destroys them. (ii) In finite populations demographic noise sustains quasi-cycles also outside this region, with a spectrum and variance predicted by a linear noise approximation away from the Hopf bifurcation. (iii) Reducing the connectivity of the network damps the oscillation, because naive nodes see fewer active neighbours than in a well-mixed population, and correlations measured in simulations confirm this damping mechanism; a pair approximation predicts that the sustained cycle disappears below a critical mean degree $\kc$, which decreases as $Q$ and the turnover rate decrease, and a finite-size test with up to $3.2\times10^5$ nodes confirms this threshold in simulations. (iv) At low connectivity the amplitude no longer depends on $Q$, so that sparsity erases the signature of the two-stage mechanism, whereas a faster turnover reduces the relative amplitude at every connectivity. The irregular dynamics observed in simulations are noise-driven quasi-cycles, not chaos.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francisco J. Muñoz, Juan Carlos Nuño, Luca Meacci, Mario Primicerio. 2026-10-29. Oscillations in two-stage contagion on networks: contagion structure, turnover and connectivity. https://searcharxiv.com/abs/2611.12920

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

Gradual emergence of temporal structures depending on the distance between neighboring callers in natural habitat of male treefrogs

Collective behavior, such as in-phase and anti-phase synchronizations in acoustic animals, is one of the most striking examples of self-organization in animal communication. However, understanding how synchronization emerges in natural environments has been limited by the difficulty of tracking multiple callers simultaneously in the wild. Here, we quantified spatio-temporal frequency characteristics in the choruses of wild treefrogs by combining large-scale sound-imaging and microphone-array systems. First, we performed field recordings by combining the sound-imaging system (25-66 units of sound-imaging devices) and microphone-array system (16-24 channels of microphones) between 2021 and 2023. Second, we analyzed the video and audio data and quantified the call frequency, call timing, and caller position of each male across 11 choruses comprising 66 males in total. Based on this dataset, we have shown that synchronized behavior gradually emerges between neighboring callers depending on their distances even when the call frequency and chorus density moderately vary. These findings provide field-based evidence for how local acoustic interactions generate collective temporal order in animal groups.

nlin.AO↗

Dynamics-preserving graph sparsification

Many dynamical systems unfold on networks of nodes coupled by edge interactions. This work is motivated by the following question: can we remove most edges from a networked dynamical system without significantly altering its behavior? For a given network, our goal is to find a sparser network that approximately preserves the dynamics on the nodes. We first study linear diffusion, where node values evolve according to the graph Laplacian. The dominant network sparsification method, effective resistance sampling, preserves all Laplacian eigenvalues within a uniform multiplicative bound. We show that with a limited edge budget, this is dynamically inefficient: diffusion is dominated by the slowest-decaying modes, so enforcing a uniform guarantee spends edges on fast modes that barely affect long-term dynamics. Based on this observation, we derive Diffusion Spectral Error (DSE), which evaluates in closed form the typical error in trajectories between the original and sparsified graphs over random initial conditions. Minimizing this error, which naturally prioritizes slow modes, yields sparse networks explicitly designed to preserve dynamics. At the same sparsification levels, DSE sparsification often preserves diffusion dynamics with several-fold lower error than effective resistance sampling, and up to two orders of magnitude lower on strongly modular networks. Although derived in a linear context, we empirically find that DSE sparsification gives similar improvements in the Kuramoto model (a nonlinear system of coupled oscillators), where DSE sparsification approximately preserves the synchronization threshold and, at strong coupling, order-parameter trajectories.

nlin.AO↗

Physics-informed neural network for model-based global computation of the asymptotic phase of limit-cycle oscillators

The asymptotic phase is the central object of phase reduction theory for limit-cycle oscillators. It is a scalar coordinate defined throughout the basin of attraction of a limit cycle that advances at a constant natural frequency along every trajectory. Computing the phase from a given mathematical model requires solving a first-order partial differential equation (PDE) over the entire basin, which is challenging due to high computation costs and complex boundary conditions. In this study, we propose a physics-informed neural network to efficiently calculate the asymptotic phase of limit-cycle oscillators. By incorporating three types of loss functions, we train a physics-informed neural network (PINN) to satisfy the governing PDE for the asymptotic phase and the adjoint equation for the phase gradient. The trained network delivers the phase function accurately and, via automatic differentiation, allows the calculation of the phase gradient governing the oscillator's response to perturbations, which enables rapid entrainment closed-loop control using strong inputs. We validate the approach using three types of limit-cycle oscillators and demonstrate that the PINN can facilitate fast and global phase-locking control.

nlin.AO↗