Spatial scales of COVID-19 transmission in Mexico.

During outbreaks of emerging infectious diseases, internationally connected cities often experience large and early outbreaks, while rural regions follow after some delay. This hierarchical structure of disease spread is influenced primarily by the multiscale structure of human mobility. However, during the COVID-19 epidemic, public health responses typically did not take into consideration the explicit spatial structure of human mobility when designing nonpharmaceutical interventions (NPIs). NPIs were applied primarily at national or regional scales. Here, we use weekly anonymized and aggregated human mobility data and spatially highly resolved data on COVID-19 cases at the municipality level in Mexico to investigate how behavioral changes in response to the pandemic have altered the spatial scales of transmission and interventions during its first wave (March-June 2020). We find that the epidemic dynamics in Mexico were initially driven by exports of COVID-19 cases from Mexico State and Mexico City, where early outbreaks occurred. The mobility network shifted after the implementation of interventions in late March 2020, and the mobility network communities became more disjointed while epidemics in these communities became increasingly synchronized. Our results provide dynamic insights into how to use network science and epidemiological modeling to inform the spatial scale at which interventions are most impactful in mitigating the spread of COVID-19 and infectious diseases in general.

Modelling COVID-19.

As the COVID-19 pandemic continues, mathematical epidemiologists share their views on what models reveal about how the disease has spread, the current state of play and what work still needs to be done.

Crowding and the shape of COVID-19 epidemics.

The coronavirus disease 2019 (COVID-19) pandemic is straining public health systems worldwide, and major non-pharmaceutical interventions have been implemented to slow its spread1-4. During the initial phase of the outbreak, dissemination of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) was primarily determined by human mobility from Wuhan, China5,6. Yet empirical evidence on the effect of key geographic factors on local epidemic transmission is lacking7. In this study, we analyzed highly resolved spatial variables in cities, together with case count data, to investigate the role of climate, urbanization and variation in interventions. We show that the degree to which cases of COVID-19 are compressed into a short period of time (peakedness of the epidemic) is strongly shaped by population aggregation and heterogeneity, such that epidemics in crowded cities are more spread over time, and crowded cities have larger total attack rates than less populated cities. Observed differences in the peakedness of epidemics are consistent with a meta-population model of COVID-19 that explicitly accounts for spatial hierarchies. We paired our estimates with globally comprehensive data on human mobility and predict that crowded cities worldwide could experience more prolonged epidemics.

Exotic phase transitions of k-cores in clustered networks.

The giant k-core-maximal connected subgraph of a network where each node has at least k neighbors-is important in the study of phase transitions and in applications of network theory. Unlike Erdos-Rényi graphs and other random networks where k-cores emerge discontinuously for k≥3, we show that transitive linking (or triadic closure) leads to 3-cores emerging through single or double phase transitions of both discontinuous and continuous nature. We also develop a k-core calculation that includes clustering and provides insights into how high-level connectivity emerges.

Message-passing approach for recurrent-state epidemic models on networks.

Epidemic processes are common out-of-equilibrium phenomena of broad interdisciplinary interest. Recently, dynamic message-passing (DMP) has been proposed as an efficient algorithm for simulating epidemic models on networks, and in particular for estimating the probability that a given node will become infectious at a particular time. To date, DMP has been applied exclusively to models with one-way state changes, as opposed to models like SIS and SIRS where nodes can return to previously inhabited states. Because many real-world epidemics can exhibit such recurrent dynamics, we propose a DMP algorithm for complex, recurrent epidemic models on networks. Our approach takes correlations between neighboring nodes into account while preventing causal signals from backtracking to their immediate source, and thus avoids "echo chamber effects" where a pair of adjacent nodes each amplify the probability that the other is infectious. We demonstrate that this approach well approximates results obtained from Monte Carlo simulation and that its accuracy is often superior to the pair approximation (which also takes second-order correlations into account). Moreover, our approach is more computationally efficient than the pair approximation, especially for complex epidemic models: the number of variables in our DMP approach grows as 2mk where m is the number of edges and k is the number of states, as opposed to mk^{2} for the pair approximation. We suspect that the resulting reduction in computational effort, as well as the conceptual simplicity of DMP, will make it a useful tool in epidemic modeling, especially for high-dimensional inference tasks.

Message-passing approach for threshold models of behavior in networks.

We study a simple model of how social behaviors, like trends and opinions, propagate in networks where individuals adopt the trend when they are informed by threshold T neighbors who are adopters. Using a dynamic message-passing algorithm, we develop a tractable and computationally efficient method that provides complete time evolution of each individual's probability of adopting the trend or of the frequency of adopters and nonadopters in any arbitrary networks. We validate the method by comparing it with Monte Carlo-based agent simulation in real and synthetic networks and provide an exact analytic scheme for large random networks, where simulation results match well. Our approach is general enough to incorporate non-Markovian processes and to include heterogeneous thresholds and thus can be applied to explore rich sets of complex heterogeneous agent-based models.