SearcharxivSearch

arXiv subjects

Luca Gallo

Publications and source records attributed to Luca Gallo.

17 recordsLinked to original sources

Polarization and Integration in Global AI Research

The AI race amplifies security risks and international tensions. While the US restricts mobility and knowledge flows, challenges regulatory efforts to protect its advantage, China leads initiatives of global governance. Both strategies depend on cross-country relationships in AI innovation; yet, how this system evolves is unclear. Here, we measure the processes of polarization and integration in the global AI research over three decades by using large-scale data of scientific publications. Comparing cross-country collaboration and citation links to their random realizations, we find that the US and China have long diverged in both dimensions, forming two poles around which global AI research increasingly revolves. While the United Kingdom and Germany have integrated exclusively with the US, many European countries have converged with both poles. Developing and further developed countries, however, only integrate with China, signaling its expanding influence over the international AI research landscape. Our results inform national science policies and efforts toward global AI regulations.

physics.soc-ph

Gender disparities in the dissemination and acquisition of scientific knowledge

Recent research has challenged the widespread belief that gender inequities in academia would disappear simply by increasing the number of women. More complex causes might be at play, embodied in the networked structure of scientific collaborations. Here, we aim to understand the structural inequality between male and female scholars in the dissemination of scientific knowledge. We use a large-scale dataset of academic publications from the American Physical Society (APS) to build a time-varying network of collaborations from 1970 to 2020. We model knowledge dissemination as a contagion process in which scientists become informed based on the propagation of knowledge through their collaborators. We quantify the fairness of the system in terms of how women acquire and diffuse knowledge compared to men. Our results indicate that knowledge acquisition and diffusion are slower for women than expected. We find that the main determinant of women's disadvantage is the gap in the cumulative number of collaborators, highlighting how time creates structural disadvantages that contribute to marginalize women in physics. Our work sheds light on how the dynamics of scientific collaborations shape gender disparities in knowledge dissemination and calls for a deeper understanding on how to intervene to improve fairness and diversity in the scientific community.

physics.soc-ph

Team careers in science: formation, composition and success of persistent collaborations

Teams are the fundamental units propelling innovation and advancing modern science. A rich literature links the fundamental features of teams, such as their size and diversity, to academic success. However, such analyses fail to capture temporal patterns, treating each group of co-authors as a distinct unit and neglecting the existence of persistent collaborations. By contrast, teams are dynamical entities, made of core members who consistently work together, surrounded by transient members who sporadically participate. Leveraging on a large dataset of over 205 million scientific papers published since 1900, we extract 511,550 core teams of statistically significant persistent collaborations of pairs and larger groups of scientists. We look into `team careers' investigating their trajectories in time, characterizing their formation, productivity and eventual dissolution. We characterize team composition along multiple dimensions, including age, academic affiliation and scientific disciplines. Finally, we investigate the academic impact of persistent collaborations, hallmarking the key compositional features underlying their success. Our work sheds light on the nature of persistent teams, informing researchers, institutions and funding agencies about the dynamics of their formation, evolution and success.

physics.soc-ph

Higher-order modeling of face-to-face interactions

The most fundamental social interactions among humans occur face-to-face. Their features have been extensively studied in recent years, owing to the availability of high-resolution data on individuals' proximity. Mathematical models based on mobile agents have been crucial to understanding the spatio-temporal organization of face-to-face interactions. However, these models focus on dyadic relationships only, failing to characterize interactions in larger groups of individuals. Here, we propose a model in which agents interact with each other by forming groups of different sizes. Each group has a degree of social attractiveness, based on which neighboring agents decide whether to join. Our framework reproduces different properties of groups in face-to-face interactions, including their distribution, the correlation in their number, and their persistence in time, which dyadic models cannot replicate. Furthermore, it captures homophilic patterns at the level of higher-order interactions, going beyond standard pairwise approaches. Our work provides further evidence that higher-order interactions are key to describe human face-to-face contacts, paving the way for further investigation of how group dynamics at a microscopic scale affects social phenomena at a macroscopic scale.

physics.soc-ph

The dynamics of leadership and success in software development teams

From science to industry, teamwork plays a crucial role in knowledge production and innovation. Most studies consider teams as static groups of individuals, thereby failing to capture how the micro-dynamics of collaborative processes and organizational changes determine team success. Here, we leverage fine-grained temporal data on software development teams from three software ecosystems -- Rust, JavaScript, and Python -- to gain insights into the dynamics of online collaborative projects. Our analysis reveals an uneven workload distribution in teams, with stronger heterogeneity correlated with higher success, and the early emergence of a lead developer carrying out the majority of work. Moreover, we find that a sizeable fraction of projects experience a change of lead developer, with such a transition being more likely in projects led by inexperienced users. Finally, we show that leadership change is associated with faster success growth. Our work contributes to a deeper understanding of the link between team evolution and success in collaborative processes.

physics.soc-ph

Reducibility of higher-order networks from dynamics

Empirical complex systems can be characterized not only by pairwise interactions, but also by higher-order (group) interactions influencing collective phenomena, from metabolic reactions to epidemics. Nevertheless, higher-order networks' apparent superior descriptive power -- compared to classical pairwise networks -- comes with a much increased model complexity and computational cost, challenging their application. Consequently, it is of paramount importance to establish a quantitative method to determine when such a modeling framework is advantageous with respect to pairwise models, and to which extent it provides a valuable description of empirical systems. Here, we propose an information-theoretic framework, accounting for how structure affect diffusion behaviors, quantifying the entropic cost and distinguishability of higher-order interactions to assess their reducibility to lower-order structures while preserving relevant functional information. Empirical analyses indicate that some systems retain essential higher-order structure, whereas in some technological and biological networks it collapses to pairwise interactions. With controlled randomization procedures, we investigate the role of nestedness and degree heterogeneity in this reducibility process. Our findings contribute to ongoing efforts to minimize the dimensionality of models for complex systems.

physics.soc-ph

MPXGAT: An Attention based Deep Learning Model for Multiplex Graphs Embedding

Graph representation learning has rapidly emerged as a pivotal field of study. Despite its growing popularity, the majority of research has been confined to embedding single-layer graphs, which fall short in representing complex systems with multifaceted relationships. To bridge this gap, we introduce MPXGAT, an innovative attention-based deep learning model tailored to multiplex graph embedding. Leveraging the robustness of Graph Attention Networks (GATs), MPXGAT captures the structure of multiplex networks by harnessing both intra-layer and inter-layer connections. This exploitation facilitates accurate link prediction within and across the network's multiple layers. Our comprehensive experimental evaluation, conducted on various benchmark datasets, confirms that MPXGAT consistently outperforms state-of-the-art competing algorithms.

cs.LG

A pair-based approximation for simplicial contagion

Higher-order interactions play an important role in complex contagion processes. Mean-field approximations have been used to characterize the onset of spreading in the presence of group interactions. However, individual-based mean-field models are unable to capture correlations between different subsets of nodes, which can significantly influence the dynamics of a contagion process. In this paper, we introduce a pair-based mean-field approximation that allows to study the dynamics of a SIS model on simplicial complexes by taking into account correlations at the level of pairs of nodes. %by taking into account dynamical correlations emerging in groups of nodes. Compared to individual-based mean-field approaches, the proposed approximation yields more accurate predictions of the dynamics of contagion processes on simplicial complexes. Specifically, the pair-based mean-field approximation provides higher accuracy in predicting the extent of the region of bistability, the type of transition from disease-free to endemic state, and the average time evolution of the fraction of infected individuals. Crucially, the pair-based approximation correctly predicts that the onset of the epidemic outbreak in simplicial complexes depends on the strength of higher-order interactions. Overall, our findings highlight the importance of accounting for pair correlations when investigating contagion processes in the presence of higher-order interactions.

physics.soc-ph

Complex contagion in social systems with distrust

Social systems are characterized by the presence of group interactions and by the existence of both trust and distrust relations. Although there is a wide literature on signed social networks, where positive signs associated to the links indicate trust, friendship, agreement, while negative signs represent distrust, antagonism, and disagreement, very little is known about the effect that signed interactions can have on the spreading of social behaviors when higher-order interactions are taken into account. In this paper we focus on processes of complex contagion, such as the adoption of social norms, where exposure to multiple sources is needed for the contagion to occur. Complex contagion has been recently modeled by higher-order networks, such as simplicial complexes, which allow transmission to happen not only through the links connecting pair of nodes, but also in group interactions, namely over simplices of dimension larger or equal than two. Here, we introduce a model of complex contagion on signed simplicial complexes, and we investigate the role played by trust and distrust on the dynamics of a social contagion process. The presence of higher-order signed structures in our model naturally induces new infection and recovery mechanisms. Through numerical simulations and analytical results in the mean-field approximation, we show how distrust determines the way the system moves from a state where no individuals adopt the social behavior, to a state where a finite fraction of the population actively spreads it. Interestingly, the fraction of spreading individuals displays a non-monotonic dependence on the average number of connections between individuals. We then investigate how social balance affects social contagion, finding that balanced triads either promote or impede contagion based on the relative abundance of fully trusted relations.

physics.soc-ph

Hypergraphx: a library for higher-order network analysis

From social to biological systems, many real-world systems are characterized by higher-order, non-dyadic interactions. Such systems are conveniently described by hypergraphs, where hyperedges encode interactions among an arbitrary number of units. Here, we present an open-source python library, hypergraphx (HGX), providing a comprehensive collection of algorithms and functions for the analysis of higher-order networks. These include different ways to convert data across distinct higher-order representations, a large variety of measures of higher-order organization at the local and the mesoscale, statistical filters to sparsify higher-order data, a wide array of static and dynamic generative models, and an implementation of different dynamical processes with higher-order interactions. Our computational framework is general, and allows to analyse hypergraphs with weighted, directed, signed, temporal and multiplex group interactions. We provide visual insights on higher-order data through a variety of different visualization tools. We accompany our code with an extended higher-order data repository, and demonstrate the ability of HGX to analyse real-world systems through a systematic analysis of a social network with higher-order interactions. The library is conceived as an evolving, community-based effort, which will further extend its functionalities over the years. Our software is available at https://github.com/HGX-Team/hypergraphx

physics.soc-ph

Higher-order correlations reveal complex memory in temporal hypergraphs

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. We analyze various social systems, finding that groups of different sizes have typical patterns of long-range temporal correlations. Moreover, our method reveals the presence of non-trivial temporal interdependencies between different group sizes. We introduce a model of temporal hypergraphs with non-Markovian group interactions, which reveals complex memory as a fundamental mechanism underlying the pattern in the data.

physics.soc-ph

Turing patterns in systems with high-order interactions

Turing theory of pattern formation is among the most popular theoretical means to account for the variety of spatio-temporal structures observed in Nature and, for this reason, finds applications in many different fields. While Turing patterns have been thoroughly investigated on continuous support and on networks, only a few attempts have been made towards their characterization in systems with higher-order interactions. In this paper, we propose a way to include group interactions in reaction-diffusion systems, and we study their effects on the formation of Turing patterns. To achieve this goal, we rewrite the problem originally studied by Turing in a general form that accounts for a microscropic description of interactions of any order in the form of a hypergraph, and we prove that the interplay between the different orders of interaction may either enhance or repress the emergence of Turing patterns. Our results shed light on the mechanisms of pattern-formation in systems with many-body interactions and pave the way for further extensions of Turing original framework.

nlin.PS

MultiSAGE: a multiplex embedding algorithm for inter-layer link prediction

Research on graph representation learning has received great attention in recent years. However, most of the studies so far have focused on the embedding of single-layer graphs. The few studies dealing with the problem of representation learning of multilayer structures rely on the strong hypothesis that the inter-layer links are known, and this limits the range of possible applications. Here we propose MultiSAGE, a generalization of the GraphSAGE algorithm that allows to embed multiplex networks. We show that MultiSAGE is capable to reconstruct both the intra-layer and the inter-layer connectivity, outperforming GraphSAGE, which has been designed for simple graphs. Next, through a comprehensive experimental analysis, we shed light also on the performance of the embedding, both in simple and in multiplex networks, showing that either the density of the graph or the randomness of the links strongly influences the quality of the embedding.

cs.LG

Synchronization induced by directed higher-order interactions

Non-reciprocal interactions play a crucial role in many social and biological complex systems. While directionality has been thoroughly accounted for in networks with pairwise interactions, its effects in systems with higher-order interactions have not yet been explored as deserved. Here, we introduce the concept of M-directed hypergraphs, a general class of directed higher-order structures, which allow to investigate dynamical systems coupled through directed group interactions. As an application we study the synchronization of nonlinear oscillators on 1-directed hypergraphs, finding that directed higher-order interactions can destroy synchronization, but also stabilize otherwise unstable synchronized states.

nlin.AO

Individual- and pair-based models of epidemic spreading: master equations and analysis of their forecasting capabilities

Mathematical modeling of disease spreading plays a crucial role in understanding, controlling and preventing epidemic outbreaks. In a microscopic description of the propagation of a disease over the complex network of human contacts, the probability that an individual is in a given state (susceptible, infectious, recovered etc) depends on the state of its neighbors in the network. Thus it depends on the state of pairs of nodes, which in turns depends on triples, in a hierarchy of dynamical dependencies. In order to produce models that are at the same time reliable and manageable, one has to understand how to truncate such a hierarchy, and how the chosen order of approximation affects the ability of the model to forecast the real temporal evolution of an epidemics. In this paper we provide a systematic analysis of the reliability (under different hypotheses on the quantity and quality of available data) of the predictions obtained by truncating the hierarchy either at the level of individuals or at the level of pairs. We find that pair-based models are reliable tools both for estimating the epidemiological parameters and for forecasting the temporal evolution of the epidemics, under all conditions taken into account in our work. However, a pair-based approach provides a much better prediction of an individual-based one, only if better data, namely information on the state of node pairs, are available. Overall, our results suggest that more refined mathematical models need to be informed by improved contact tracing techniques to better support decision on policies and containment measures to adopt.

physics.soc-ph

Lack of practical identifiability may hamper reliable predictions in COVID-19 epidemic models

Compartmental models are widely adopted to describe and predict the spreading of infectious diseases. The unknown parameters of such models need to be estimated from the data. Furthermore, when some of the model variables are not empirically accessible, as in the case of asymptomatic carriers of COVID-19, they have to be obtained as an outcome of the model. Here, we introduce a framework to quantify how the uncertainty in the data impacts the determination of the parameters and the evolution of the unmeasured variables of a given model. We illustrate how the method is able to characterize different regimes of identifiability, even in models with few compartments. Finally, we discuss how the lack of identifiability in a realistic model for COVID-19 may prevent reliable forecasting of the epidemic dynamics.

physics.soc-ph

A Multi-agent approach for $\textit{in silico}$ simulations of micro-biological systems

Using a Multi-agent systems paradigm, the present project develops, validates and exploits a computational $\textit{testbed}$ that simulates micro-biological complex systems, namely the aggregation patterns of the social amoeba $\textit{Dyctiostelium discoideum}$. We propose a new design and implementation for managing discrete simulations with autonomous agents on a microscopic scale, thus focusing on their social behavior and mutual interactions. Then, the dependence on the main physical variables is tested, namely density and number of amoebas; in addition, we analyze the robustness of the dynamics against various noise sources. Along with these results, we suggest a methodology for further studies that make use of our validated model.

q-bio.CB