arXiv subjects

Yamir Moreno

Publications and source records attributed to Yamir Moreno.

At least 73 records · Page 4Linked to original sources

arXiv2020

Unique superdiffusion induced by directionality in multiplex networks

The multilayer network framework has served to describe and uncover a number of novel and unforeseen physical behaviors and regimes in interacting complex systems. However, the majority of existing studies are built on undirected multilayer networks while most complex systems in nature exhibit directed interactions. Here, we propose a framework to analyze diffusive dynamics on multilayer networks consisting of at least one directed layer. We rigorously demonstrate that directionality in multilayer networks can fundamentally change the behavior of diffusive dynamics: from monotonic (in undirected systems) to non-monotonic diffusion with respect to the interlayer coupling strength. Moreover, for certain multilayer network configurations, the directionality can induce a unique superdiffusion regime for intermediate values of the interlayer coupling, wherein the diffusion is even faster than that corresponding to the theoretical limit for undirected systems, i.e., the diffusion in the integrated network obtained from the aggregation of each layer. We theoretically and numerically show that the existence of superdiffusion is fully determined by the directionality of each layer and the topological overlap between layers. We further provide a formulation of multilayer networks displaying superdiffusion. Our results highlight the significance of incorporating the interacting directionality in multilevel networked systems and provide a framework to analyze dynamical processes on interconnected complex systems with directionality.

physics.soc-ph↗

arXiv2020

Dynamics of heuristics selection for cooperative behaviour

Situations involving cooperative behaviour are widespread among animals and humans alike. Game theory and evolutionary dynamics have provided the theoretical and computational grounds to understand what are the mechanisms that allow for such cooperation. Studies in this area usually take into consideration different behavioural strategies and investigate how they can be fixed in the population under evolving rules. However, how those strategies emerged from basic evolutionary mechanisms continues to be not fully understood. To address this issue, here we study the emergence of cooperative strategies through a model of heuristics selection based on evolutionary algorithms. In the proposed model, agents interact with other players according to a heuristic specified by their genetic code and reproduce -- at a longer time scale -- proportionally to their fitness. We show that the system can evolve to cooperative regimes for low mutation rates through heuristics selection while increasing the mutation decreases the level of cooperation. Our analysis of possible strategies shows that reciprocity and punishment are the main ingredients for cooperation to emerge, being conditional cooperation the more frequent strategy. Additionally, we show that if in addition to behavioural rules, genetic relatedness is included, then kinship plays a relevant role. Our results illustrate that our evolutionary heuristics model is a generic and powerful tool to study the evolution of cooperative behaviour.

physics.soc-ph↗

arXiv2020

Disease and information spreading at different speeds in multiplex networks

Nowadays, one of the challenges we face when carrying out modeling of epidemic spreading is to develop methods to control disease transmission. In this article we study how the spreading of knowledge of a disease affects the propagation of that disease in a population of interacting individuals. For that, we analyze the interaction between two different processes on multiplex networks: the propagation of an epidemic using the susceptible-infected-susceptible dynamics and the dissemination of information about the disease --and its prevention methods-- using the unaware-aware-unaware dynamics, so that informed individuals are less likely to be infected. Unlike previous related models where disease and information spread at the same time scale, we introduce here a parameter that controls the relative speed between the propagation of the two processes. We study the behavior of this model using a mean-field approach that gives results in good agreement with Monte Carlo simulations on homogeneous complex networks. We find that increasing the rate of information dissemination reduces the disease prevalence, as one may expect. However, increasing the speed of the information process as compared to that of the epidemic process has the counter intuitive effect of increasing the disease prevalence. This result opens an interesting discussion about the effects of information spreading on disease propagation.

physics.soc-ph↗

arXiv2020

The role of time scale in the spreading of asymmetrically interacting diseases

Diseases and other contagion phenomena in nature and society can interact asymmetrically, such that one can benefit from the other, which in turn impairs the first, in analogy with predator-prey systems. Here, we consider two models for interacting disease-like dynamics with asymmetric interactions and different associated time scales. Using rate equations for homogeneously mixed populations, we show that the stationary prevalences and phase diagrams of each model behave differently with respect to variations of the relative time scales. We also characterize in detail the regime where transient oscillations are observed, a pattern that is inherent to asymmetrical interactions but often ignored in the literature. Our results contribute to a better understanding of disease dynamics in particular, and interacting processes in general, and could provide interesting insights for real-world applications, most notably, the interplay between the dynamics of fact-checked and fake news.

physics.soc-ph↗

arXiv2020

Quantifying Uncertainty in a Predictive Model for Popularity Dynamics

The Hawkes process has garnered attention in recent years for its suitability to describe the behavior of online information cascades. Here, we present a fully tractable approach to analytically describe the distribution of the number of events in a Hawkes process, which, in contrast to purely empirical studies or simulation-based models, enables the effect of process parameters on cascade dynamics to be analyzed. We show that the presented theory also allows predictions regarding the future distribution of events after a given number of events have been observed during a time window. Our results are derived through a differential-equation approach to attain the governing equations of a general branching process. We confirm our theoretical findings through extensive simulations of such processes. This work provides the basis for more complete analyses of the self-exciting processes that govern the spreading of information through many communication platforms, including the potential to predict cascade dynamics within confidence limits.

physics.soc-ph↗

arXiv2020

Impact of intra and inter-cluster coupling balance on the performance of nonlinear networked systems

The dynamical and structural aspects of cluster synchronization (CS) in complex systems have been intensively investigated in recent years. Here, we study CS of dynamical systems with intra and inter-cluster couplings. We propose new metrics that describe the performance of such systems and evaluate them as a function of the strength of the couplings within and between clusters. We obtain analytical results that indicate that spectral differences between the Laplacian matrices associated with the partition between intra and inter-couplings directly affect the proposed metrics of system performance. Our results show that the dynamics of the system might exhibit an optimal balance that optimizes its performance. Our work provides new insights into the way specific symmetry properties relate to collective behavior, and could lead to new forms to increase the controllability of complex systems and to optimize their stability.

physics.soc-ph↗

arXiv2020

Phase transitions and stability of dynamical processes on hypergraphs

Hypergraphs naturally represent higher-order interactions, which persistently appear from social interactions to neural networks and other natural systems. Although their importance is well recognized, a theoretical framework to describe general dynamical processes on hypergraphs is not available yet. In this paper, we bridge this gap and derive expressions for the stability of dynamical systems defined on an arbitrary hypergraph. The framework allows us to reveal that, near the fixed point, the relevant structure is the graph-projection of the hypergraph and that it is possible to identify the role of each structural order for a given process. We also analytically solve two dynamics of general interest, namely, social contagion and diffusion processes, and show that the stability conditions can be decoupled in structural and dynamical components. Our results show that in social contagion processes, only pairwise interactions play a role in the stability of the absorbing state, while for the diffusion dynamics, the order of the interactions plays a differential role. Ours is the first attempt to provide a general framework for further exploration of dynamical processes on hypergraphs.

physics.soc-ph↗

arXiv2020

Universality of eigenvector delocalization and the nature of the SIS phase transition in multiplex networks

Universal spectral properties of multiplex networks allow us to assess the nature of the transition between disease-free and endemic phases in the SIS epidemic spreading model. In a multiplex network, depending on a coupling parameter, $p$, the inverse participation ratio ($IPR$) of the leading eigenvector of the adjacency matrix can be in two different structural regimes: (i) layer-localized and (ii) delocalized. Here we formalize the structural transition point, $p^*$, between these two regimes, showing that there are universal properties regarding both the layer size $n$ and the layer configurations. Namely, we show that $IPR \sim n^{-δ}$, with $δ\approx 1$, and revealed an approximately linear relationship between $p^*$ and the difference between the layers' average degrees. Furthermore, we showed that this multiplex structural transition is intrinsically connected with the nature of the SIS phase transition, allowing us to both understand and quantify the phenomenon. As these results are related to the universal properties of the leading eigenvector, we expect that our findings might be relevant to other dynamical processes in complex networks.

physics.soc-ph↗

arXiv2020

Prediction of scientific collaborations through multiplex interaction networks

Link prediction algorithms can help to understand the structure and dynamics of scientific collaborations and the evolution of Science. However, available algorithms based on similarity between nodes of collaboration networks are bounded by the limited amount of links present in these networks. In this work, we reduce the latter intrinsic limitation by generalizing the Adamic-Adar method to multiplex networks composed by an arbitrary number of layers, that encode diverse forms of scientific interactions. We show that the new metric outperforms other single-layered, similarity-based scores and that scientific credit, represented by citations, and common interests, measured by the usage of common keywords, can be predictive of new collaborations. Our work paves the way for a deeper understanding of the dynamics driving scientific collaborations, and provides a new algorithm for link prediction in multiplex networks that can be applied to a plethora of systems.

physics.soc-ph↗

arXiv2020

Effect of memory, intolerance and second-order reputation on cooperation

The understanding of cooperative behavior in social systems has been the subject of intense research over the past decades. In this regard, the theoretical models used to explain cooperation in human societies have been complemented with a growing interest in experimental studies to validate the proposed mechanisms. In this work, we rely on previous experimental findings to build a theoretical model based on two cooperation driving mechanisms: second-order reputation and memory. Specifically, taking the Donation Game as a starting point, the agents are distributed among three strategies, namely Unconditional Cooperators, Unconditional Defectors, and Discriminators, where the latter follow a second-order assessment rule: Shunning, Stern Judging, Image Scoring, or Simple Standing. A discriminator will cooperate if the evaluation of the recipient's last actions contained in his memory is above a threshold of (in)tolerance. In addition to the dynamics inherent to the game, another imitation dynamics, involving much longer times (generations), is introduced. The model is approached through a mean-field approximation that predicts the macroscopic behavior observed in Monte Carlo simulations. We found that, while in most second-order assessment rules, intolerance hinders cooperation, it has the opposite (positive) effect under the Simple Standing rule. Furthermore, we show that, when considering memory, the Stern Judging rule shows the lowest values of cooperation, while stricter rules show higher cooperation levels.

physics.soc-ph↗

arXiv2020

Data-driven contact structures: from homogeneous mixing to multilayer networks

The modeling of the spreading of communicable diseases has experienced significant advances in the last two decades or so. This has been possible due to the proliferation of data and the development of new methods to gather, mine and analyze it. A key role has also been played by the latest advances in new disciplines like network science. Nonetheless, current models still lack a faithful representation of all possible heterogeneities and features that can be extracted from data. Here, we bridge a current gap in the mathematical modeling of infectious diseases and develop a framework that allows to account simultaneously for both the connectivity of individuals and the age-structure of the population. We compare different scenarios, namely, i) the homogeneous mixing setting, ii) one in which only the social mixing is taken into account, iii) a setting that considers the connectivity of individuals alone, and finally, iv) a multilayer representation in which both the social mixing and the number of contacts are included in the model. We analytically show that the thresholds obtained for these four scenarios are different. In addition, we conduct extensive numerical simulations and conclude that heterogeneities in the contact network are important for a proper determination of the epidemic threshold, whereas the age-structure plays a bigger role beyond the onset of the outbreak. Altogether, when it comes to evaluate interventions such as vaccination, both sources of individual heterogeneity are important and should be concurrently considered. Our results also provide an indication of the errors incurred in situations in which one cannot access all needed information in terms of connectivity and age of the population.

physics.soc-ph↗

arXiv2020

Centrality anomalies in complex networks as a result of model over-simplification

Tremendous advances have been made in our understanding of the properties and evolution of complex networks. These advances were initially driven by information-poor empirical networks and theoretical analysis of unweighted and undirected graphs. Recently, information-rich empirical data complex networks supported the development of more sophisticated models that include edge directionality and weight properties, and multiple layers. Many studies still focus on unweighted undirected description of networks, prompting an essential question: how to identify when a model is simpler than it must be? Here, we argue that the presence of centrality anomalies in complex networks is a result of model over-simplification. Specifically, we investigate the well-known anomaly in betweenness centrality for transportation networks, according to which highly connected nodes are not necessarily the most central. Using a broad class of network models with weights and spatial constraints and four large data sets of transportation networks, we show that the unweighted projection of the structure of these networks can exhibit a significant fraction of anomalous nodes compared to a random null model. However, the weighted projection of these networks, compared with an appropriated null model, significantly reduces the fraction of anomalies observed, suggesting that centrality anomalies are a symptom of model over-simplification. Because lack of information-rich data is a common challenge when dealing with complex networks and can cause anomalies that misestimate the role of nodes in the system, we argue that sufficiently sophisticated models be used when anomalies are detected.

physics.soc-ph↗

arXiv2020

A novel route to cyclic dominance in voluntary social dilemmas

Cooperation is the backbone of modern human societies, making it a priority to understand how successful cooperation-sustaining mechanisms operate. Cyclic dominance, a non-transitive setup comprising at least three strategies wherein the first strategy overrules the second which overrules the third which, in turn, overrules the first strategy, is known to maintain bio-diversity, drive competition between bacterial strains, and preserve cooperation in social dilemmas. Here, we present a novel route to cyclic dominance in voluntary social dilemmas by adding to the traditional mix of cooperators, defectors, and loners, a fourth player type, risk-averse hedgers, who enact tit-for-tat upon paying a hedging cost to avoid being exploited. When this cost is sufficiently small, cooperators, defectors, and hedgers enter a loop of cyclic dominance that preserves cooperation even under the most adverse conditions. In contrast, when the hedging cost is large, hedgers disappear, consequently reverting to the traditional interplay of cooperators, defectors, and loners. In the interim region of hedging costs, complex evolutionary dynamics ensues, prompting transitions between states with two, three, or four competing strategies. Our results thus reveal that voluntary participation is but one pathway to sustained cooperation via cyclic dominance.

physics.soc-ph↗

arXiv2020

Measuring Nestedness: A comparative study of the performance of different metrics

Nestedness is a property of interaction networks widely observed in natural mutualistic communities. Despite a widespread interest on this pattern, no general consensus exists on how to measure it. Instead, several metrics aiming at quantifying nestedness, based on different but not necessarily independent properties of the networks, coexist in the literature blurring the comparison between ecosystems. In this work, we present a detailed critical study of the behavior of six popular nestedness metrics and the variants of two of them. In order to evaluate their performance, we compare the obtained values of the nestedness of a large set of real networks among them and against a maximum entropy and maximum likelihood null model. Our results point out, first, that the metrics do not rank the degree of nestedness of networks universally. Furthermore, several metrics show significant undesired dependencies on the network properties considered. The study of these dependencies allows us to understand some of the systematic shifts between the real values of nestedness and the average over the null model. This paper intends to provide readers with a critical guide on how to measure nestedness patterns, by explaining the functioning of six standard metrics and two of its variants, and then disclosing its qualities and flaws. By doing so, we also aim to extend the application of the recently proposed null models based on maximum entropy to the still largely unexplored area of ecological networks. Finally, to complement the guide, we provide a fully-documented repository named nullnest which gathers the codes to produce the null model and calculate the nestedness index -- both the real value and the null expectation -- using the studied metrics. The repository contains, moreover, the main results of the null model applied to a large dataset of more than 200 bipartite networks.

physics.soc-ph↗

arXiv2019

Spectral and localization properties of random bipartite graphs

Bipartite graphs are often found to represent the connectivity between the components of many systems such as ecosystems. A bipartite graph is a set of $n$ nodes that is decomposed into two disjoint subsets, having $m$ and $n-m$ vertices each, such that there are no adjacent vertices within the same set. The connectivity between both sets, which is the relevant quantity in terms of connections, can be quantified by a parameter $α\in[0,1]$ that equals the ratio of existent adjacent pairs over the total number of possible adjacent pairs. Here, we study the spectral and localization properties of such random bipartite graphs. Specifically, within a Random Matrix Theory (RMT) approach, we identify a scaling parameter $ξ\equivξ(n,m,α)$ that fixes the localization properties of the eigenvectors of the adjacency matrices of random bipartite graphs. We also show that, when $ξ<1/10$ ($ξ>10$) the eigenvectors are localized (extended), whereas the localization--to--delocalization transition occurs in the interval $1/10<ξ<10$. Finally, given the potential applications of our findings, we round off the study by demonstrating that for fixed $ξ$, the spectral properties of our graph model are also universal.

cond-mat.dis-nn↗

arXiv2019

A machine learning approach to predicting dynamical observables from network structure

Estimating the outcome of a given dynamical process from structural features is a key unsolved challenge in network science. The goal is hindered by difficulties associated to nonlinearities, correlations and feedbacks between the structure and dynamics of complex systems. In this work, we develop an approach based on machine learning algorithms that is shown to provide an answer to the previous challenge. Specifically, we show that it is possible to estimate the outbreak size of a disease starting from a single node as well as the degree of synchronicity of a system made up of Kuramoto oscillators. In doing so, we show which topological features of the network are key for this estimation, and provide a rank of the importance of network metrics with higher accuracy than previously done. Our approach is general and can be applied to any dynamical process running on top of complex networks. Likewise, our work constitutes an important step towards the application of machine learning methods to unravel dynamical patterns emerging in complex networked systems.

physics.soc-ph↗

arXiv2019

Crash dynamics of interdependent networks

The emergence and evolution of real-world systems have been extensively studied in the last few years. However, equally important phenomena are related to the dynamics of systems' collapse, which has been less explored, especially when they can be cast into interdependent systems. In this paper, we develop a dynamical model that allows scrutinizing the collapse of systems composed of two interdependent networks. Specifically, we explore the dynamics of the system's collapse under two scenarios: in the first one, the condition for failure should be satisfied for the focal node as well as for its corresponding node in the other network; while in the second one, it is enough that failure of one of the nodes occurs in either of the two networks. We report extensive numerical simulations of the dynamics performed in different setups of interdependent networks, and analyze how the system behavior depends on the previous scenarios as well as on the topology of the interdependent system. Our results can provide valuable insights into the crashing dynamics and evolutionary properties of interdependent complex systems.

physics.soc-ph↗

arXiv2019

Social contagion models on hypergraphs

Our understanding of the dynamics of complex networked systems has increased significantly in the last two decades. However, most of our knowledge is built upon assuming pairwise relations among the system's components. This is often an oversimplification, for instance, in social interactions that occur frequently within groups. To overcome this limitation, here we study the dynamics of social contagion on hypergraphs. We develop an analytical framework and provide numerical results for arbitrary hypergraphs, which we also support with Monte Carlo simulations. Our analyses show that the model has a vast parameter space, with first and second-order transitions, bi-stability, and hysteresis. Phenomenologically, we also extend the concept of latent heat to social contexts, which might help understanding oscillatory social behaviors. Our work unfolds the research line of higher-order models and the analytical treatment of hypergraphs, posing new questions and paving the way for modeling dynamical processes on these networks.

physics.soc-ph↗