Search

Abstract A wide range of tasks in network analysis, such as clustering network populations or identifying anomalies in temporal graph streams, require a measure of the similarity between two graphs. To provide a meaningful data summary for downstream scientific analyses, the graph similarity measures used for these tasks must be principled, interpretable, and capable of distinguishing meaningful overlapping network structure from statistical noise at different scales of interest. Here we derive a family of graph mutual information measures that satisfy these criteria and are constructed using only fundamental information theoretic principles. Our measures capture the information shared among networks according to different encodings of their structural information, with our mesoscale mutual information measure allowing for network comparison under any specified network coarse-graining. We test our measures in a range of applications on real and synthetic network data, finding that they effectively highlight intuitive aspects of network similarity across scales in a variety of systems.

Abstract A wide variety of complex systems are characterized by interactions of different types involving varying numbers of units. Multiplex hypergraphs serve as a tool to describe such structures, capturing distinct types of higher-order interactions among a collection of units. In this work, we introduce a comprehensive set of measures to describe structural connectivity patterns in multiplex hypergraphs, considering scales from node and hyperedge levels to the system’s mesoscale. We validate our measures with three real-world datasets: scientific co-authorship in physics, movie collaborations, and high school interactions. This validation reveals new collaboration patterns, identifies trends within and across movie subfields, and provides insights into daily interaction dynamics. Our framework aims to offer a more nuanced characterization of real-world systems marked by both multiplex and higher-order interactions.

Abstract Many real-world complex systems are characterized by interactions in groups that change in time. Current temporal network approaches, however, are unable to describe group dynamics, as they are based on pairwise interactions only. Here, we use time-varying hypergraphs to describe such systems, and we introduce a framework based on higher-order correlations to characterize their temporal organization. The analysis of human interaction data reveals the existence of coherent and interdependent mesoscopic structures, thus capturing aggregation, fragmentation and nucleation processes in social systems. We introduce a model of temporal hypergraphs with non-Markovian group interactions, which reveals complex memory as a fundamental mechanism underlying the emerging pattern in the data.

Advancements in technology have recently allowed us to collect and analyse large-scale fine-grained data about human performance, drastically changing the way we approach sports. Here, we provide the first comprehensive analysis of individual and team performance in One-Day International cricket, one of the most popular sports in the world. We investigate temporal patterns of individual success by quantifying the location of the best performance of a player and find that they can happen at any time in their career, surrounded by a burst of comparable top performances. Our analysis shows that long-term performance can be predicted from early observations and that temporary exclusions of players from teams are often due to declining performances but are also associated with strong comebacks. By computing the duration of streaks of winning performances compared to random expectations, we demonstrate that teams win and lose matches consecutively. We define the contributions of specialists such as openers, all-rounders and wicket-keepers and show that a balanced performance from multiple individuals is required to ensure team success. Finally, we measure how transitioning to captaincy in the team improves the performance of batsmen, but not that of bowlers. Our work emphasizes how individual endeavours and team dynamics interconnect and influence collective outcomes in sports.

Complex real-world networks with higher-order interactions can be described and analyzed using two types of representation, simplicial complexes and hypergraphs. The authors show that choice of representation is essential and demonstrate its impact on emerging collective dynamics in the network.

Abstract From sports to science, the recent availability of large-scale data has allowed to gain insights on the drivers of human innovation and success in a variety of domains. Here we quantify human performance in the popular game of chess by leveraging a very large dataset comprising of over 120 million games between almost 1 million players. We find that individuals encounter hot streaks of repeated success, longer for beginners than for expert players, and even longer cold streaks of unsatisfying performance. Skilled players can be distinguished from the others based on their gaming behaviour. Differences appear from the very first moves of the game, with experts tending to specialize and repeat the same openings while beginners explore and diversify more. However, experts experience a broader response repertoire, and display a deeper understanding of different variations within the same line. Over time, the opening diversity of a player tends to decrease, hinting at the development of individual playing styles. Nevertheless, we find that players are often not able to recognize their most successful openings. Overall, our work contributes to quantifying human performance in competitive settings, providing a first large-scale quantitative analysis of individual careers in chess, helping unveil the determinants separating elite from beginner performance.

Networks with higher-order interactions are known to provide better representation of real networked systems. Here the authors introduce a framework based on statistical inference to detect overlapping communities and predict hyperedges of any size in hypergraphs.

Abstract From sport and science production to everyday life, higher-level pursuits demand collaboration. Despite an increase in the number of data-driven studies on human behavior, the social dynamics of collaborative problem solving are still largely unexplored with network science and other computational and quantitative tools. Here we introduce escape rooms as a non-interventional and minimally biased social laboratory, which allows us to capture at a high resolution real-time communications in small project teams. Our analysis portrays a nuanced picture of different dimensions of social dynamics. We reveal how socio-demographic characteristics impact problem solving and the importance of prior relationships for enhanced interactions. We extract key conversation rules from motif analysis and discuss turn-usurping gendered behavior, a phenomenon particularly strong in male-dominated teams. We investigate the temporal evolution of signed and group interactions, finding that a minimum level of tense communication might be beneficial for collective problem solving, and revealing differences in the behavior of successful and failed teams. Our work unveils the innovative potential of escape rooms to study teams in their complexity, contributing to a deeper understanding of the micro-dynamics of collaborative team processes.

Recent research has shown that pair interactions in a given network are superseded by higher-order interactions and to incorporate these features into our understanding of a network additional mathematical tools, such as hypergraphs, are required. Here, the authors develop an algorithm to detect motifs in hypergraphs and show how they can be used to identify structural differences in a variety of real-world systems.

Ecological and genetic factors have influenced the composition of the human microbiome during our evolutionary history. We analysed the oral microbiota of the Agta, a hunter–gatherer population where some members have adopted an agricultural diet. We show that age is the strongest factor modulating the microbiome, probably through immunosenescence since we identified an increase in the number of species classified as pathogens with age. We also characterised biological and cultural processes generating sexual dimorphism in the oral microbiome. A small subset of oral bacteria is influenced by the host genome, linking host collagen genes to bacterial biofilm formation. Our data also suggest that shifting from a fish/meat diet to a rice-rich diet transforms their microbiome, mirroring the Neolithic transition. All of these factors have implications in the epidemiology of oral diseases. Thus, the human oral microbiome is multifactorial and shaped by various ecological and social factors that modify the oral environment.

Here we investigate the effects of extensive sociality and mobility on the oral microbiome of 138 Agta hunter–gatherers from the Philippines. Our comparisons of microbiome composition showed that the Agta are more similar to Central African BaYaka hunter–gatherers than to neighbouring farmers. We also defined the Agta social microbiome as a set of 137 oral bacteria (only 7% of 1980 amplicon sequence variants) significantly influenced by social contact (quantified through wireless sensors of short-range interactions). We show that large interaction networks including strong links between close kin, spouses and even unrelated friends can significantly predict bacterial transmission networks across Agta camps. Finally, we show that more central individuals to social networks are also bacterial supersharers. We conclude that hunter–gatherer social microbiomes are predominantly pathogenic and were shaped by evolutionary tradeoffs between extensive sociality and disease spread.

The increasing availability of new data on biological and sociotechnical systems highlights the importance of well grounded filtering techniques to separate meaningful interactions from noise. In this work the authors propose the first method to detect informative connections of any order in statistically validated hypergraphs, showing on synthetic benchmarks and real-world systems that the highlighted hyperlinks are more informative than those extracted with traditional pairwise approaches.

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

Quantitative methods of prioritization are necessary to optimize the selection of protected areas for biodiversity conservation. Reserve selection is traditionally based on single species, considers representative habitats or, occasionally, spatial configuration but mostly the needs of the society. However, protecting particular species as independent entities is not enough to ensure effective conservation of ecological communities, since their functioning depends on the interactions between species. We propose a strategy to identify priority areas for protection based on species interaction networks. Similar local networks are grouped according to two different sets of network features: interacting species pairs and overall network structure. These groups or clusters of networks are used to delimitate ecological subregions, which are then compared to current nature reserves. Subregions with a lower proportion of protected area are given higher priority. Results from species pairs and network structure are finally combined to obtain the network protection priority index. We present a case study applying this strategy to the Brazilian Atlantic Forest, using plant-pollinator networks. We found that subregions based on network structure show a more grainy pattern, and approach spatial patterns related to forest formation types, while subregions based on species pairs show more distinct patches and a higher level of detail in the division, especially for interior forests. Highest priority is given to portions of the seasonal semi-deciduous and deciduous forest, especially NE São Paulo, NW Paraná, N Rio Grande do Sul and E Minas Gerais and, secondarily, W São Paulo and the São Francisco region. The approach we suggest here goes beyond the level of species, seeking to perpetuate the ecological interactions and networks that make up biological communities. It is our hope and conviction that this strategy contributes to the development of more effective conservation planning.

Abstract Luck is considered a crucial ingredient to achieve impact in all creative domains, despite their diversity. For instance, in science, the movie industry, music, and art, the occurrence of the highest impact work and a hot streak within a creative career are very difficult to predict. Are there domains that are more prone to luck than others? Here, we provide new insights on the role of randomness in impact in creative careers in two ways: (i) we systematically untangle luck and individual ability to generate impact in the movie, music, and book industries, and in science, and compare the luck factor between these fields; (ii) we show the surprising presence of randomness in the relationship between collaboration networks and timing of career hits. Taken together, our analysis suggests that luck consistently affects career impact across all considered sectors and improves our understanding in pinpointing the key elements in driving success.

In Alzheimer’s disease (AD), the progressive atrophy leads to aberrant network reconfigurations both at structural and functional levels. In such network reorganization, the core and peripheral nodes appear to be crucial for the prediction of clinical outcome because of their ability to influence large-scale functional integration. However, the role of the different types of brain connectivity in such prediction still remains unclear. Using a multiplex network approach we integrated information from DWI, fMRI, and MEG brain connectivity to extract an enriched description of the core-periphery structure in a group of AD patients and age-matched controls. Globally, the regional coreness—that is, the probability of a region to be in the multiplex core—significantly decreased in AD patients as result of a random disconnection process initiated by the neurodegeneration. Locally, the most impacted areas were in the core of the network—including temporal, parietal, and occipital areas—while we reported compensatory increments for the peripheral regions in the sensorimotor system. Furthermore, these network changes significantly predicted the cognitive and memory impairment of patients. Taken together these results indicate that a more accurate description of neurodegenerative diseases can be obtained from the multimodal integration of neuroimaging-derived network data. Alzheimer’s disease includes a progressive destruction of axonal pathways leading to global network changes. While these changes affect both the anatomy and the function of the brain, a joint characterization of the impact on the nodes of the network is still lacking. By integrating information from multiple neuroimaging data, within a modern complex systems framework, we show that the nodes constituting the core of the brain network are the most impacted by the disconnection process. Furthermore, these network alterations significantly predict the cognitive and memory impairment of patients and represent potential biomarkers of disease progression. We posit that a more accurate description of neurodegenerative diseases can be obtained by analyzing and modeling brain networks derived from multimodal neuroimaging data.

Urban transportation networks, from pavements and bicycle paths to streets and railways, provide the backbone for movement and socioeconomic life in cities. To make urban transport sustainable, cities are increasingly investing to develop their bicycle networks. However, it is yet unclear how to extend them comprehensively and effectively given a limited budget. Here we investigate the structure of bicycle networks in cities around the world, and find that they consist of hundreds of disconnected patches, even in cycling-friendly cities like Copenhagen. To connect these patches, we develop and apply data-driven, algorithmic network growth strategies, showing that small but focused investments allow to significantly increase the connectedness and directness of urban bicycle networks. We introduce two greedy algorithms to add the most critical missing links in the bicycle network focusing on connectedness, and show that they outmatch both a random approach and a baseline minimum investment strategy. Our computational approach outlines novel pathways from car-centric towards sustainable cities by taking advantage of urban data available on a city-wide scale. It is a first step towards a quantitative consolidation of bicycle infrastructure development that can become valuable for urban planners and stakeholders.

Urban mobility increasingly relies on multimodality, combining the use of bicycle paths, streets, and rail networks. These different modes of transportation are well described by multiplex networks. Here we propose the overlap census method which extracts a multimodal profile from a city's multiplex transportation network. We apply this method to 15 cities, identify clusters of cities with similar profiles, and link this feature to the level of sustainable mobility of each cluster. Our work highlights the importance of evaluating all the transportation systems of a city together to adequately identify and compare its potential for sustainable, multimodal mobility.

Abstract Despite the presence of increasing pressure towards globalisation, the coexistence of different cultures is a distinctive feature of human societies. However, how multiculturality can emerge in a population of individuals inclined to imitation, and how it remains stable under cultural drift, i.e. the spontaneous mutation of traits in the population, still needs to be understood. To solve such a problem, we propose here a microscopic model of culture dissemination which takes into account that, in real social systems, the interactions are organised in various layers corresponding to different interests or topics. We show that the addition of multiplexity in the modeling of our society generates qualitatively novel dynamical behavior, producing a new stable regime of cultural diversity. This finding suggests that the layered organisation of social influence typical of modern societies is the key ingredient to explain why and how multiculturality emerges and thrives in our world.

Universality is one of the key concepts in understanding critical phenomena. However, for interacting inhomogeneous systems described by complex networks, a clear understanding of the relevant parameters for universality is still missing. Here we discuss the role of a fundamental network parameter for universality, the spectral dimension. For this purpose, we construct a complex network model where the probability of a bond between two nodes is proportional to a power law of the nodes' distances. By explicit computation we prove that the spectral dimension for this model can be tuned continuously from 1 to infinity, and we discuss related network connectivity measures. We propose our model as a tool to probe universal behavior on inhomogeneous structures and comment on the possibility that the universal behavior of correlated models on such networks mimics the one of continuous field theories in fractional Euclidean dimensions.

The emergence of synchronization in systems of coupled agents is a pivotal phenomenon in physics, biology, computer science, and neuroscience. Traditionally, interaction systems have been described as networks, where links encode information only on the pairwise influences among the nodes. Yet, in many systems, interactions among the units take place in larger groups. Recent work has shown that the presence of higher-order interactions between oscillators can significantly affect the emerging dynamics. However, these early studies have mostly considered interactions up to four oscillators at time, and analytical treatments are limited to the all-to-all setting. Here, we propose a general framework that allows us to effectively study populations of oscillators where higher-order interactions of all possible orders are considered, for any complex topology described by arbitrary hypergraphs, and for general coupling functions. To this end, we introduce a multiorder Laplacian whose spectrum determines the stability of the synchronized solution. Our framework is validated on three structures of interactions of increasing complexity. First, we study a population with all-to-all interactions at all orders, for which we can derive in a full analytical manner the Lyapunov exponents of the system, and for which we investigate the effect of including attractive and repulsive interactions. Second, we apply the multiorder Laplacian framework to synchronization on a synthetic model with heterogeneous higher-order interactions. Finally, we compare the dynamics of coupled oscillators with higher-order and pairwise couplings only, for a real dataset describing the macaque brain connectome, highlighting the importance of faithfully representing the complexity of interactions in real-world systems. Taken together, our multiorder Laplacian allows us to obtain a complete analytical characterization of the stability of synchrony in arbitrary higher-order networks, paving the way toward a general treatment of dynamical processes beyond pairwise interactions.

Diffusion describes the motion of microscopic entities from regions of high concentration to regions of low concentration. In multiplex networks, flows can occur both within and across layers, and super-diffusion, a regime where the time scale of the multiplex to reach equilibrium is smaller than that of single networks in isolation, can emerge due to the interplay of these two mechanisms. In the limits of strong and weak inter-layer couplings multiplex diffusion has been linked to the spectrum of the supra-Laplacian associated to the system. However, a general theory for the emergence of this behavior is still lacking. Here we shed light on how the structural and dynamical features of the multiplex affect the Laplacian spectral properties. For instance, we find that super-diffusion emerges the earliest in systems with poorly diffusive layers, and that its onset is independent from the presence of overlap, which only influences the maximum relative intensity of the phenomenon. Moreover, a uniform allocation of resources to enhance diffusion within layers is preferable, as highly intra-layer heterogenous flows might hamper super-diffusion. Last, in multiplex networks formed by many layers, diffusion is best promoted by strengthening inter-layer flows across dissimilar layers. Our work can turn useful for the design of interconnected infrastructures in real-world transportation systems, clarifying the determinants able to drive the system towards the super-diffusive regime.

Community structures in collaboration networks reflect the natural tendency of individuals to organize their work in groups in order to better achieve common goals. In most of the cases, individuals exploit their connections to introduce themselves to new areas of interests, giving rise to multifaceted collaborations which span different fields. In this paper, we analyse collaborations in science and among movie actors as multiplex networks, where the layers represent respectively research topics and movie genres, and we show that communities indeed coexist and overlap at the different layers of such systems. We then propose a model to grow multiplex networks based on two mechanisms of intra and inter-layer triadic closure which mimic the real processes by which collaborations evolve. We show that our model is able to explain the multiplex community structure observed empirically, and we infer the strength of the two underlying social mechanisms from real-world systems. Being also able to correctly reproduce the values of intra-layer and inter-layer assortativity correlations, the model contributes to a better understanding of the principles driving the evolution of social networks.

Synergies between evolutionary game theory and statistical physics have significantly improved our understanding of public cooperation in structured populations. Multiplex networks, in particular, provide the theoretical framework within network science that allows us to mathematically describe the rich structure of interactions characterizing human societies. While research has shown that multiplex networks may enhance the resilience of cooperation, the interplay between the overlap in the structure of the layers and the control parameters of the corresponding games has not yet been investigated. With this aim, we consider here the public goods game on a multiplex network, and we unveil the role of the number of layers and the overlap of links, as well as the impact of different synergy factors in different layers, on the onset of cooperation. We show that enhanced public cooperation emerges only when a significant edge overlap is combined with at least one layer being able to sustain some cooperation by means of a sufficiently high synergy factor. In the absence of either of these conditions, the evolution of cooperation in multiplex networks is determined by the bounds of traditional network reciprocity with no enhanced resilience. These results caution against overly optimistic predictions that the presence of multiple social domains may in itself promote cooperation, and they help us better understand the complexity behind prosocial behavior in layered social systems.

Efficient techniques to navigate networks with local information are fundamental to sample large-scale online social systems and to retrieve resources in peer-to-peer systems. Biased random walks, i.e. walks whose motion is biased on properties of neighbouring nodes, have been largely exploited to design smart local strategies to explore a network, for instance by constructing maximally mixing trajectories or by allowing an almost uniform sampling of the nodes. Here we introduce and study biased random walks on multiplex networks, graphs where the nodes are related through different types of links organised in distinct and interacting layers, and we provide analytical solutions for their long-time properties, including the stationary occupation probability distribution and the entropy rate. We focus on degree-biased random walks and distinguish between two classes of walks, namely those whose transition probability depends on a number of parameters which is extensive in the number of layers, and those whose motion depends on intrinsically multiplex properties of the neighbouring nodes. We analyse the effect of the structure of the multiplex network on the steady-state behaviour of the walkers, and we find that heterogeneous degree distributions as well as the presence of inter-layer degree correlations and edge overlap determine the extent to which a multiplex can be efficiently explored by a biased walk. Finally we show that, in real-world multiplex transportation networks, the trade-off between efficient navigation and resilience to link failure has resulted into systems whose diffusion properties are qualitatively different from those of appropriately randomised multiplex graphs. This fact suggests that multiplexity is an important ingredient to include in the modelling of real-world systems.