Infection patterns in simple and complex contagion processes on networks.

Contagion processes, representing the spread of infectious diseases, information, or social behaviors, are often schematized as taking place on networks, which encode for instance the interactions between individuals. The impact of the network structure on spreading process has been widely investigated, but not the reverse question: do different processes unfolding on a given network lead to different infection patterns? How do the infection patterns depend on a model's parameters or on the nature of the contagion processes? Here we address this issue by investigating the infection patterns for a variety of models. In simple contagion processes, where contagion events involve one connection at a time, we find that the infection patterns are extremely robust across models and parameters. In complex contagion models instead, in which multiple interactions are needed for a contagion event, non-trivial dependencies on models parameters emerge, as the infection pattern depends on the interplay between pairwise and group contagions. In models involving threshold mechanisms moreover, slight parameter changes can significantly impact the spreading paths. Our results show that it is possible to study crucial features of a spread from schematized models, and inform us on the variations between spreading patterns in processes of different nature.

Patterns in Temporal Networks with Higher-Order Egocentric Structures.

The analysis of complex and time-evolving interactions, such as those within social dynamics, represents a current challenge in the science of complex systems. Temporal networks stand as a suitable tool for schematizing such systems, encoding all the interactions appearing between pairs of individuals in discrete time. Over the years, network science has developed many measures to analyze and compare temporal networks. Some of them imply a decomposition of the network into small pieces of interactions; i.e., only involving a few nodes for a short time range. Along this line, a possible way to decompose a network is to assume an egocentric perspective; i.e., to consider for each node the time evolution of its neighborhood. This was proposed by Longa et al. by defining the "egocentric temporal neighborhood", which has proven to be a useful tool for characterizing temporal networks relative to social interactions. However, this definition neglects group interactions (quite common in social domains), as they are always decomposed into pairwise connections. A more general framework that also allows considering larger interactions is represented by higher-order networks. Here, we generalize the description of social interactions to hypergraphs. Consequently, we generalize their decomposition into "hyper egocentric temporal neighborhoods". This enables the analysis of social interactions, facilitating comparisons between different datasets or nodes within a dataset, while considering the intrinsic complexity presented by higher-order interactions. Even if we limit the order of interactions to the second order (triplets of nodes), our results reveal the importance of a higher-order representation.In fact, our analyses show that second-order structures are responsible for the majority of the variability at all scales: between datasets, amongst nodes, and over time.

Distinguishing Simple and Complex Contagion Processes on Networks.

Contagion processes on networks, including disease spreading, information diffusion, or social behaviors propagation, can be modeled as simple contagion, i.e., as a contagion process involving one connection at a time, or as complex contagion, in which multiple interactions are needed for a contagion event. Empirical data on spreading processes, however, even when available, do not easily allow us to uncover which of these underlying contagion mechanisms is at work. We propose a strategy to discriminate between these mechanisms upon the observation of a single instance of a spreading process. The strategy is based on the observation of the order in which network nodes are infected, and on its correlations with their local topology: these correlations differ between processes of simple contagion, processes involving threshold mechanisms, and processes driven by group interactions (i.e., by "higher-order" mechanisms). Our results improve our understanding of contagion processes and provide a method using only limited information to distinguish between several possible contagion mechanisms.

Endogenous crisis waves: stochastic model with synchronized collective behavior.

We propose a simple framework to understand commonly observed crisis waves in macroeconomic agent-based models, which is also relevant to a variety of other physical or biological situations where synchronization occurs. We compute exactly the phase diagram of the model and the location of the synchronization transition in parameter space. Many modifications and extensions can be studied, confirming that the synchronization transition is extremely robust against various sources of noise or imperfections.

Temporal clustering of social interactions trades-off disease spreading and knowledge diffusion.

Non-pharmaceutical measures such as preventive quarantines, remote working, school and workplace closures, lockdowns, etc. have shown effectiveness from an epidemic control perspective; however, they have also significant negative consequences on social life and relationships, work routines and community engagement. In particular, complex ideas, work and school collaborations, innovative discoveries and resilient norms formation and maintenance, which often require face-to-face interactions of two or more parties to be developed and synergically coordinated, are particularly affected. In this study, we propose an alternative hybrid solution that balances the slowdown of epidemic diffusion with the preservation of face-to-face interactions, that we test simulating a disease and a knowledge spreading simultaneously on a network of contacts. Our approach involves a two-step partitioning of the population. First, we tune the level of node clustering, creating 'social bubbles' with increased contacts within each bubble and fewer outside, while maintaining the average number of contacts in each network. Second, we tune the level of temporal clustering by pairing, for a certain time interval, nodes from specific social bubbles. Our results demonstrate that a hybrid approach can achieve better trade-offs between epidemic control and complex knowledge diffusion. The versatility of our model enables tuning and refining clustering levels to optimally achieve the desired trade-off, based on the potentially changing characteristics of a disease or knowledge diffusion process.

Measuring close proximity interactions in summer camps during the COVID-19 pandemic.

Policy makers have implemented multiple non-pharmaceutical strategies to mitigate the COVID-19 worldwide crisis. Interventions had the aim of reducing close proximity interactions, which drive the spread of the disease. A deeper knowledge of human physical interactions has revealed necessary, especially in all settings involving children, whose education and gathering activities should be preserved. Despite their relevance, almost no data are available on close proximity contacts among children in schools or other educational settings during the pandemic. Contact data are usually gathered via Bluetooth, which nonetheless offers a low temporal and spatial resolution. Recently, ultra-wideband (UWB) radios emerged as a more accurate alternative that nonetheless exhibits a significantly higher energy consumption, limiting in-field studies. In this paper, we leverage a novel approach, embodied by the Janus system that combines these radios by exploiting their complementary benefits. The very accurate proximity data gathered in-field by Janus, once augmented with several metadata, unlocks unprecedented levels of information, enabling the development of novel multi-level risk analyses. By means of this technology, we have collected real contact data of children and educators in three summer camps during summer 2020 in the province of Trento, Italy. The wide variety of performed daily activities induced multiple individual behaviors, allowing a rich investigation of social environments from the contagion risk perspective. We consider risk based on duration and proximity of contacts and classify interactions according to different risk levels. We can then evaluate the summer camps' organization, observe the effect of partition in small groups, or social bubbles, and identify the organized activities that mitigate the riskier behaviors. Overall, we offer an insight into the educator-child and child-child social interactions during the pandemic, thus providing a valuable tool for schools, summer camps, and policy makers to (re)structure educational activities safely.

Temporal properties of higher-order interactions in social networks.

Human social interactions in local settings can be experimentally detected by recording the physical proximity and orientation of people. Such interactions, approximating face-to-face communications, can be effectively represented as time varying social networks with links being unceasingly created and destroyed over time. Traditional analyses of temporal networks have addressed mostly pairwise interactions, where links describe dyadic connections among individuals. However, many network dynamics are hardly ascribable to pairwise settings but often comprise larger groups, which are better described by higher-order interactions. Here we investigate the higher-order organizations of temporal social networks by analyzing five publicly available datasets collected in different social settings. We find that higher-order interactions are ubiquitous and, similarly to their pairwise counterparts, characterized by heterogeneous dynamics, with bursty trains of rapidly recurring higher-order events separated by long periods of inactivity. We investigate the evolution and formation of groups by looking at the transition rates between different higher-order structures. We find that in more spontaneous social settings, group are characterized by slower formation and disaggregation, while in work settings these phenomena are more abrupt, possibly reflecting pre-organized social dynamics. Finally, we observe temporal reinforcement suggesting that the longer a group stays together the higher the probability that the same interaction pattern persist in the future. Our findings suggest the importance of considering the higher-order structure of social interactions when investigating human temporal dynamics.

Random walks on hypergraphs.

In the past 20 years network science has proven its strength in modeling many real-world interacting systems as generic agents, the nodes, connected by pairwise edges. Nevertheless, in many relevant cases, interactions are not pairwise but involve larger sets of nodes at a time. These systems are thus better described in the framework of hypergraphs, whose hyperedges effectively account for multibody interactions. Here we propose and study a class of random walks defined on such higher-order structures and grounded on a microscopic physical model where multibody proximity is associated with highly probable exchanges among agents belonging to the same hyperedge. We provide an analytical characterization of the process, deriving a general solution for the stationary distribution of the walkers. The dynamics is ultimately driven by a generalized random-walk Laplace operator that reduces to the standard random-walk Laplacian when all the hyperedges have size 2 and are thus meant to describe pairwise couplings. We illustrate our results on synthetic models for which we have full control of the high-order structures and on real-world networks where higher-order interactions are at play. As the first application of the method, we compare the behavior of random walkers on hypergraphs to that of traditional random walkers on the corresponding projected networks, drawing interesting conclusions on node rankings in collaboration networks. As the second application, we show how information derived from the random walk on hypergraphs can be successfully used for classification tasks involving objects with several features, each one represented by a hyperedge. Taken together, our work contributes to unraveling the effect of higher-order interactions on diffusive processes in higher-order networks, shedding light on mechanisms at the heart of biased information spreading in complex networked systems.

Author Correction: Pattern invariance for reaction-diffusion systems on complex networks.

An amendment to this paper has been published and can be accessed via a link at the top of the paper.

Pattern invariance for reaction-diffusion systems on complex networks.

Given a reaction-diffusion system interacting via a complex network, we propose two different techniques to modify the network topology while preserving its dynamical behaviour. In the region of parameters where the homogeneous solution gets spontaneously destabilized, perturbations grow along the unstable directions made available across the networks of connections, yielding irregular spatio-temporal patterns. We exploit the spectral properties of the Laplacian operator associated to the graph in order to modify its topology, while preserving the unstable manifold of the underlying equilibrium. The new network is isodynamic to the former, meaning that it reproduces the dynamical response (pattern) to a perturbation, as displayed by the original system. The first method acts directly on the eigenmodes, thus resulting in a general redistribution of link weights which, in some cases, can completely change the structure of the original network. The second method uses localization properties of the eigenvectors to identify and randomize a subnetwork that is mostly embedded only into the stable manifold. We test both techniques on different network topologies using the Ginzburg-Landau system as a reference model. Whereas the correlation between patterns on isodynamic networks generated via the first recipe is larger, the second method allows for a finer control at the level of single nodes. This work opens up a new perspective on the multiple possibilities for identifying the family of discrete supports that instigate equivalent dynamical responses on a multispecies reaction-diffusion system.

Control of multidimensional systems on complex network.

Multidimensional systems coupled via complex networks are widespread in nature and thus frequently invoked for a large plethora of interesting applications. From ecology to physics, individual entities in mutual interactions are grouped in families, homogeneous in kind. These latter interact selectively, through a sequence of self-consistently regulated steps, whose deeply rooted architecture is stored in the assigned matrix of connections. The asymptotic equilibrium eventually attained by the system, and its associated stability, can be assessed by employing standard nonlinear dynamics tools. For many practical applications, it is however important to externally drive the system towards a desired equilibrium, which is resilient, hence stable, to external perturbations. To this end we here consider a system made up of N interacting populations which evolve according to general rate equations, bearing attributes of universality. One species is added to the pool of interacting families and used as a dynamical controller to induce novel stable equilibria. Use can be made of the root locus method to shape the needed control, in terms of intrinsic reactivity and adopted protocol of injection. The proposed method is tested on both synthetic and real data, thus enabling to demonstrate its robustness and versatility.

The second will be first: competition on directed networks.

Multiple sinks competition is investigated for a walker diffusing on directed complex networks. The asymmetry of the imposed spatial support makes the system non transitive. As a consequence, it is always possible to identify a suitable location for the second absorbing sink that screens at most the flux of agents directed against the first trap, whose position has been preliminarily assigned. The degree of mutual competition between pairs of nodes is analytically quantified through apt indicators that build on the topological characteristics of the hosting graph. Moreover, the positioning of the second trap can be chosen so as to minimize, at the same time, the probability of being in turn shaded by a thirdly added trap. Supervised placing of absorbing traps on a asymmetric disordered and complex graph is hence possible, as follows a robust optimization protocol. This latter is here discussed and successfully tested against synthetic data.