We consider epidemic extinction in finite networks with a broad variation in local connectivity. Generalizing the theory of large fluctuations to random networks with a given degree distribution, we are able to predict the most probable, or optimal, paths to extinction in various configurations, including truncated power laws. We find that paths for heterogeneous networks follow a limiting form in which infection first decreases in low-degree nodes, which triggers a rapid extinction in high-degree nodes, and finishes with a residual low-degree extinction. The usefulness of our approach is further demonstrated through optimal control strategies that leverage the dependence of finite-size fluctuations on network topology. Interestingly, we find that the optimal control is a mix of treating both high- and low-degree nodes based on theoretical predictions, in contrast to methods that ignore dynamical fluctuations.

Many networks must maintain synchrony despite the fact that they operate in noisy environments. Important examples are stochastic inertial oscillators, which are known to exhibit fluctuations with broad tails in many applications, including electric power networks with renewable energy sources. Such non-Gaussian fluctuations can result in rare network desynchronization. Here we build a general theory for inertial oscillator network desynchronization by non-Gaussian noise. We compute the rate of desynchronization and show that higher-moments of noise enter at specific powers of coupling: either speeding up or slowing down the rate exponentially depending on how noise statistics match the statistics of a network's slowest mode. Finally, we use our theory to introduce a technique that drastically reduces the effective description of network desynchronization. Most interestingly, when instability is associated with a single edge, the reduction is to one stochastic oscillator.

We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.

We propose an analytical technique to study large fluctuations and switching from internal noise in complex networks. Using order-disorder kinetics as a generic example, we construct and analyze the most probable, or optimal path of fluctuations from one ordered state to another in real and synthetic networks. The method allows us to compute the distribution of large fluctuations and the time scale associated with switching between ordered states for networks consistent with mean-field assumptions. In general, we quantify how network heterogeneity influences the scaling patterns and probabilities of fluctuations. For instance, we find that the probability of a large fluctuation near an order-disorder transition decreases exponentially with the participation ratio of a network’s principle eigenvector – measuring how many nodes effectively contribute to an ordered state. Finally, the proposed theory is used to answer how and where a network should be targeted in order to optimize the time needed to observe a switch.

Infection dynamics have been studied extensively on complex networks, yielding insight into the effects of heterogeneity in contact patterns on disease spread. Somewhat separately, metapopulations have provided a paradigm for modeling systems with spatially extended and "patchy" organization. In this paper we expand on the use of multitype networks for combining these paradigms, such that simple contagion models can include complexity in the agent interactions and multiscale structure. We first present a generalization of the Volz-Miller mean-field approximation for Susceptible-Infected-Recovered (SIR) dynamics on multitype networks. We then use this technique to study the special case of epidemic fronts propagating on a one-dimensional lattice of interconnected networks -representing a simple chain of coupled population centers -as a necessary first step in understanding how macro-scale disease spread depends on micro-scale topology. Using the formalism of front propagation into unstable states, we derive the effective transport coefficients of the linear spreading: asymptotic speed, characteristic wavelength, and diffusion coefficient for the leading edge of the pulled fronts, and analyze their dependence on the underlying graph structure. We also derive the epidemic threshold for the system and study the front profile for various network configurations. To our knowledge, this is the first such application of front propagation concepts to random network models.