Searcharxiv⌕ Search

arXiv subjects

Alain Barrat

Publications and source records attributed to Alain Barrat.

At least 19 recordsLinked to original sources
arXiv2026

Group adaptation drives opinion dynamics in higher-order networks

In modern interconnected societies, opinions and beliefs can quickly spread across large populations, giving rise to collective behaviors such as the adoption of social norms or polarization. These phenomena have motivated many models aimed at reproducing emergent properties from simple interaction mechanisms. In particular, opinion dynamics models describe how individual opinions evolve through interactions and study the conditions for global consensus or polarization. Most models assume that these interactions occur between pairs of agents, typically on a fixed network structure. However, opinion changes can occur in groups, which may also undergo adaptive changes if disagreement arises. Here, we propose a bounded confidence model that incorporates both mechanisms: group discussions can lead to global agreement among members, while strong internal disagreement causes groups to split, with resulting subgroups merging with others. We systematically study the model outcomes as a function of agents' tolerance for agreement. Strikingly, adaptivity suppresses key effects of group interactions, restoring a phenomenology close to that of pairwise interactions. In particular, adaptivity enables the formation of large groups and prevents fragmentation at small tolerance. It also restores a phase transition from polarization to consensus, which would otherwise disappear in a non-adaptive group-based model. Overall, our work shows that both adaptivity and group interactions shape the structure of social ties and global opinion dynamics in a population.

physics.soc-ph↗
arXiv2026

Higher-order adaptive behaviors outperform pairwise strategies in mitigating contagion dynamics

When exposed to a contagion phenomenon, individuals may respond to the perceived risk of infection by adopting behavioral changes, aiming to reduce their exposure or their risk of infecting others. The social cost of such adaptive behaviors and their impact on the contagion dynamics have been investigated in pairwise networks, with binary interactions driving both contagion and risk perception. However, contagion and adaptive mechanisms can also be driven by group (higher-order) interactions. Here, we consider several adaptive behaviors triggered by awareness of risk perceived through higher-order and pairwise interactions, and we compare their impact on pairwise and higher-order contagion processes. By numerical simulations and a mean-field analytic approach, we show that adaptive behaviors driven by higher-order information are more effective in limiting the spread of a contagion, than similar mechanisms based on pairwise information. Meanwhile, they also entail a lower social cost, measured as the reduction of the intensity of interactions in the population. Indeed, adaptive mechanisms based on higher-order information lead to a heterogeneous risk perception within the population, producing a higher alert on nodes with large hyperdegree (i.e., participating in many groups), on their neighborhoods, and on large groups. This in turn prevents the spreading process to exploit the properties of these nodes and groups, which tend to drive and sustain the dynamics in the absence of adaptive behaviors.

physics.soc-ph↗
arXiv2026

Adaptive behaviors neutralize bistable explosive transitions in higher-order contagion

During contagion phenomena, individuals perceiving a risk of infection commonly adapt their behavior and reduce their exposure. The effects of such adaptive mechanisms have been studied for processes in which pairwise interactions drive contagion. However, contagion and the perception of infection risk can also involve ("higher-order") group interactions, leading potentially to new phenomenology. How adaptive behavior resulting from risk perception affects higher-order processes remains an open question. Here, we consider the impact of several risk-based adaptive behaviors on pairwise and higher-order contagion processes, using numerical simulations and an analytical mean-field approach. For pairwise contagion, adaptive mechanisms based on local (pairwise or group-based) risk perception impact only the endemic state, without affecting the epidemic phase transition. For higher-order contagion processes, instead, the adaptivity defuses the impact of non-linear group interactions: this reduces or even completely suppresses the parameter range in which bistability is possible, effectively transforming a higher-order contagion process into a pairwise one.

physics.soc-ph↗
arXiv2025

Multilayer network science: theory, methods, and applications

Multilayer network science has emerged as a central framework for analysing interconnected and interdependent complex systems. Its relevance has grown substantially with the increasing availability of rich, heterogeneous data, which makes it possible to uncover and exploit the inherently multilayered organisation of many real-world networks. In this review, we summarise recent developments in the field. On the theoretical and methodological front, we outline core concepts and survey advances in community detection, dynamical processes, temporal networks, higher-order interactions, and machine-learning-based approaches. On the application side, we discuss progress across diverse domains, including interdependent infrastructures, spreading dynamics, computational social science, economic and financial systems, ecological and climate networks, science-of-science studies, network medicine, and network neuroscience. We conclude with a forward-looking perspective, emphasizing the need for standardised datasets and software, deeper integration of temporal and higher-order structures, and a transition toward genuinely predictive models of complex systems.

physics.soc-ph↗
arXiv2025

Emerging Activity Temporal Hypergraph: a model for generating realistic time-varying hypergraphs

Time-varying group interactions constitute the building blocks of many complex systems. The framework of temporal hypergraphs makes it possible to represent them by taking into account the higher-order and temporal nature of the interactions. However, the corresponding datasets are often incomplete and/or limited in size and duration, and surrogate time-varying hypergraphs able to reproduce their statistical features constitute interesting substitutions, especially to understand how dynamical processes unfold on group interactions. Here, we present a new temporal hypergraph model, the Emerging Activity Temporal Hypergraph (EATH), which can be fed by parameters measured in a dataset and create synthetic datasets with similar properties. In the model, each node has an independent underlying activity dynamic and the overall system activity emerges from the nodes dynamics, with temporal group interactions resulting from both the activity of the nodes and memory mechanisms. We first show that the EATH model can generate surrogate hypergraphs of several empirical datasets of face-to-face interactions, mimicking temporal and topological properties at the node and hyperedge level. We also showcase the possibility to use the resulting synthetic data in simulations of higher-order contagion dynamics, comparing the outcome of such process on original and surrogate datasets. Finally, we illustrate the flexibility of the model, which can generate synthetic hypergraphs with tunable properties: as an example, we generate "hybrid" temporal hypergraphs, which mix properties of different empirical datasets. Our work opens several perspectives, from the generation of synthetic realistic hypergraphs describing contexts where data collection is difficult to a deeper understanding of dynamical processes on temporal hypergraphs.

physics.soc-ph↗
arXiv2025

Higher-order dissimilarity measures for hypergraph comparison

In recent years, networks with higher-order interactions have emerged as a powerful tool to model complex systems. Comparing these higher-order systems remains however a challenge. Traditional similarity measures designed for pairwise networks fail indeed to capture salient features of hypergraphs, hence potentially neglecting important information. To address this issue, here we introduce two novel measures, Hyper NetSimile and Hyperedge Portrait Divergence, specifically designed for comparing hypergraphs. These measures take explicitly into account the properties of multi-node interactions, using complementary approaches. They are defined for any arbitrary pair of hypergraphs, of potentially different sizes, thus being widely applicable. We illustrate the effectiveness of these metrics through clustering experiments on synthetic and empirical higher-order networks, showing their ability to correctly group hypergraphs generated by different models and to distinguish real-world systems coming from different contexts. Our results highlight the advantages of using higher-order dissimilarity measures over traditional pairwise representations in capturing the full structural complexity of the systems considered.

physics.soc-ph↗
arXiv2024

Generating surrogate temporal networks from mesoscale building blocks

Surrogate networks can constitute suitable replacements for real networks, in particular to study dynamical processes on networks, when only incomplete or limited datasets are available. As empirical datasets most often present complex features and interplays between structure and temporal evolution, creating surrogate data is however a challenging task, in particular for data describing time-resolved interactions between agents. Here we propose a method to generate surrogate temporal networks that mimic such observed datasets. The method is based on a decomposition of the original dataset into small temporal subnetworks encoding local structures on a short time scale. These are used as building blocks to generate a new synthetic temporal network that will hence inherit the shape of local interactions from the dataset. Moreover, we also take into account larger scale correlations on structural and temporal dimension, using them to inform the process of assembling the building blocks. We showcase the method by generating surrogate networks for several datasets of social interactions and comparing them to the original data on two complementary aspects. First, we show that the surrogate data possess complex structural and temporal features similar to the ones of the original data. Second, we simulate several dynamical processes, describing respectively epidemic spread, opinion formation and emergence of norms in a population, and compare the outcome of these processes on the generated and original datasets. We describe the method in detail and provide an implementation so that it can be easily used in future works based on temporally evolving networks.

physics.soc-ph↗
arXiv2024

The structural evolution of temporal hypergraphs through the lens of hyper-cores

The richness of many complex systems stems from the interactions among their components. The higher-order nature of these interactions, involving many units at once, and their temporal dynamics constitute crucial properties that shape the behaviour of the system itself. An adequate description of these systems is offered by temporal hypergraphs, that integrate these features within the same framework. However, tools for their temporal and topological characterization are still scarce. Here we develop a series of methods specifically designed to analyse the structural properties of temporal hypergraphs at multiple scales. Leveraging the hyper-core decomposition of hypergraphs, we follow the evolution of the hyper-cores through time, characterizing the hypergraph structure and its temporal dynamics at different topological scales, and quantifying the multi-scale structural stability of the system. We also define two static hypercoreness centrality measures that provide an overall description of the nodes aggregated structural behaviour. We apply the characterization methods to several data sets, establishing connections between structural properties and specific activities within the systems. Finally, we show how the proposed method can be used as a model-validation tool for synthetic temporal hypergraphs, distinguishing the higher-order structures and dynamics generated by different models from the empirical ones, and thus identifying the essential model mechanisms to reproduce the empirical hypergraph structure and evolution. Our work opens several research directions, from the understanding of dynamic processes on temporal higher-order networks to the design of new models of time-varying hypergraphs.

physics.soc-ph↗
arXiv2024

An embedding-based distance for temporal graphs

Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at different time points. However, quantifying the similarity between temporal graphs as a whole is an open problem. Here, we use embeddings based on time-respecting random walks to introduce a new notion of distance between temporal graphs. This distance is well-defined for pairs of temporal graphs with different numbers of nodes and different time spans. We study the case of a matched pair of graphs, when a known relation exists between their nodes, and the case of unmatched graphs, when such a relation is unavailable and the graphs may be of different sizes. We use empirical and synthetic temporal network data to show that the distance we introduce discriminates graphs with different topological and temporal properties. We provide an efficient implementation of the distance computation suitable for large-scale temporal graphs.

cs.SI↗
arXiv2023

Flow of temporal network properties under local aggregation and time shuffling: a tool for characterizing, comparing and classifying temporal networks

Although many tools have been developed and employed to characterize temporal networks, the issue of how to compare them remains largely open. It depends indeed on what features are considered as relevant, and on the way the differences in these features are quantified. In this paper, we propose to characterize temporal networks through their behaviour under general transformations that are local in time: (i) a local time shuffling, which destroys correlations at time scales smaller than a given scale $b$, while preserving large time scales, and (ii) a local temporal aggregation on time windows of length $n$. By varying $b$ and $n$, we obtain a flow of temporal networks, and flows of observable values, which encode the phenomenology of the temporal network on multiple time scales. We use a symbolic approach to summarize these flows into labels (strings of characters) describing their trends. These labels can then be used to compare temporal networks, validate models, or identify groups of networks with similar labels. Our procedure can be applied to any temporal network and with an arbitrary set of observables, and we illustrate it on an ensemble of data sets describing face-to-face interactions in various contexts, including both empirical and synthetic data.

physics.soc-ph↗
arXiv2023

Hyper-cores promote localization and efficient seeding in higher-order processes

Going beyond networks, to include higher-order interactions of arbitrary sizes, is a major step to better describe complex systems. In the resulting hypergraph representation, tools to identify structures and central nodes are scarce. We consider the decomposition of a hypergraph in hyper-cores, subsets of nodes connected by at least a certain number of hyperedges of at least a certain size. We show that this provides a fingerprint for data described by hypergraphs and suggests a novel notion of centrality, the hyper-coreness. We assess the role of hyper-cores and nodes with large hyper-coreness in higher-order dynamical processes: such nodes have large spreading power and spreading processes are localized in central hyper-cores. Additionally, in the emergence of social conventions very few committed individuals with high hyper-coreness can rapidly overturn a majority convention. Our work opens multiple research avenues, from comparing empirical data to model validation and study of temporally varying hypergraphs.

physics.soc-ph↗
arXiv2023

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.

physics.soc-ph↗
arXiv2023

Detecting periodic time scales in temporal networks

Temporal networks are commonly used to represent dynamical complex systems like social networks, simultaneous firing of neurons, human mobility or public transportation. Their dynamics may evolve on multiple time scales characterising for instance periodic activity patterns or structural changes. The detection of these time scales can be challenging from the direct observation of simple dynamical network properties like the activity of nodes or the density of links. Here we propose two new methods, which rely on already established static representations of temporal networks, namely supra-adjacency matrices and temporal event graphs. We define dissimilarity metrics extracted from these representations and compute their Fourier Transform to effectively identify dominant periodic time scales characterising the original temporal network. We demonstrate our methods using synthetic and real-world data sets describing various kinds of temporal networks. We find that while in all cases the two methods outperform the reference measures, the supra-adjacency based method identifies more easily periodic changes in network density, while the temporal event graph based method is better suited to detect periodic changes in the group structure of the network. Our methodology may provide insights into different phenomena occurring at multiple time-scales in systems represented by temporal networks.

physics.soc-ph↗
arXiv2023

The temporal dynamics of group interactions in higher-order social networks

Representing social systems as networks, starting from the interactions between individuals, sheds light on the mechanisms governing their dynamics. However, networks encode only pairwise interactions, while most social interactions occur among groups of individuals, requiring higher-order network representations. Despite the recent interest in higher-order networks, little is known about the mechanisms that govern the formation and evolution of groups, and how people move between groups. Here, we leverage empirical data on social interactions among children and university students to study their temporal dynamics at both individual and group levels, characterising how individuals navigate groups and how groups form and disaggregate. We find robust patterns across contexts and propose a dynamical model that closely reproduces empirical observations. These results represent a further step in understanding social systems, and open up research directions to study the impact of group dynamics on dynamical processes that evolve on top of them.

physics.soc-ph↗
arXiv2023

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. 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 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.

physics.soc-ph↗
arXiv2023

Simplicially driven simple contagion

Single contagion processes are known to display a continuous transition from an epidemic-free phase at low contagion rates to the epidemic state for rates above a critical threshold. This transition can become discontinuous when two simple contagion processes are coupled in a bi-directional symmetric way. However, in many cases, the coupling is not symmetric and the processes can be of a different nature. For example, risky social behaviors -- such as not wearing masks or engaging in large gatherings -- can affect the spread of a disease, and their adoption dynamics via social reinforcement mechanisms are better described by complex contagion models, rather than by the simple contagion paradigm, which is more appropriate for disease spreading phenomena. Motivated by this example, we consider a simplicial contagion (describing the adoption of a behavior) that uni-directionally drives a simple contagion (describing a disease propagation). We show that, above a critical driving strength, such driven simple contagion can exhibit both discontinuous transitions and bi-stability, which are instead absent in standard simple contagions. We provide a mean-field analytical description of the phase diagram of the system, and complement the results with Markov-chain simulations. Our results provide a novel route for a simple contagion process to display the phenomenology of a higher-order contagion, through a driving mechanism that may be hidden or unobservable in many practical instances.

physics.soc-ph↗
arXiv2023

Modeling framework unifying contact and social networks

Temporal networks of face-to-face interactions between individuals are useful proxies of the dynamics of social systems on fast time scales. Several empirical statistical properties of these networks have been shown to be robust across a large variety of contexts. In order to better grasp the role of various mechanisms of social interactions in the emergence of these properties, models in which schematic implementations of such mechanisms can be carried out have proven useful. Here, we put forward a new framework to model temporal networks of human interactions, based on the idea of a co-evolution and feedback between (i) an observed network of instantaneous interactions and (ii) an underlying unobserved social bond network: social bonds partially drive interaction opportunities, and in turn are reinforced by interactions and weakened or even removed by the lack of interactions. Through this co-evolution, we also integrate in the model well-known mechanisms such as triadic closure, but also the impact of {shared social context} and {non-intentional (casual) interactions}, with several tunable parameters. We then propose a method to compare the statistical properties of each version of the model with empirical face-to-face interaction data sets, to determine which sets of mechanisms lead to realistic social temporal networks within this modeling framework.

physics.soc-ph↗
arXiv2022

Group interactions modulate critical mass dynamics in social convention

How can minorities of individuals overturn social conventions? The theory of critical mass states that when a committed minority reaches a critical size, a cascade of behavioural changes can occur, overturning apparently stable social norms. Evidence comes from theoretical and empirical studies in which minorities of very different sizes, including extremely small ones, manage to bring a system to its tipping point. Here, we explore this diversity of scenarios by introducing group interactions as a crucial element of realism into a model for social convention. We find that the critical mass necessary to trigger behaviour change can be very small if individuals have a limited propensity to change their views. Moreover, the ability of the committed minority to overturn existing norms depends in a complex way on the group size. Our findings reconcile the different sizes of critical mass found in previous investigations and unveil the critical role of groups in such a process. This further highlights the importance of the emerging field of higher-order networks, beyond pairwise interactions

physics.soc-ph↗