arXiv subjects

I. Sendiña-Nadal

Publications and source records attributed to I. Sendiña-Nadal.

At least 19 recordsLinked to original sources

arXiv2025

Cooperation, satisfaction, and rationality in social games on complex networks with aspiration-driven players

A network model based on players' aspirations is proposed and analyzed theoretically and numerically within the framework of evolutionary game theory. In this model, players decide whether to cooperate or defect by comparing their payoffs from pairwise games with their neighbors, driven by a common aspiration level. The model also incorporates a degree of irrationality through an effective temperature in the Fermi function. The level of cooperation in the system is fundamentally influenced by two social attributes: satisfaction, defined as the fraction of players whose payoffs exceed the aspiration level, and the degree of rationality in decision-making. Rational players tend to maintain their initial strategies for sufficiently low aspiration levels, while irrational agents promote a state of perfect coexistence, resulting in half of the agents cooperating. The transition between these two behaviors can be critical, often leading to abrupt changes in cooperation levels. When the aspiration level is high, all players become dissatisfied, regardless of the effective temperature. Intermediate aspiration levels result in diverse behaviors, including sudden transitions for rational agents and a non-monotonic relationship between cooperation and increased irrationality. The study also carefully examines the effects of the interaction structure, initial conditions, and the strategy update rule (asynchronous versus synchronous). Special attention is given to the prisoner's dilemma, where significant cooperation levels can be achieved in a structured environment, with moderate aspiration and high rationality settings, and following a synchronous strategy updating scheme.

physics.soc-ph↗

arXiv2025

Local predictors of explosive synchronization with ordinal methods

We propose to use the ordinal pattern transition (OPT) entropy measured at sentinel central nodes as a potential predictor of explosive transitions to synchronization in networks of various dynamical systems with increasing complexity. Our results demonstrate that the OPT entropic measure surpasses traditional early warning signals (EWS) measures and could be valuable to the tools available for predicting critical transitions. In particular, we investigate networks of diffusively coupled phase oscillators and chaotic Rössler systems. As maps, we consider a neural network of Chialvo maps coupled in star and scale-free configurations. Furthermore, we apply this measure to time series data obtained from a network of electronic circuits operating in the chaotic regime.

nlin.CD↗

arXiv2022

Deterministic and stochastic cooperation transitions in evolutionary games on networks

Although the cooperative dynamics emerging from a network of interacting players has been exhaustively investigated, it is not yet fully understood when and how network reciprocity drives cooperation transitions. In this work, we investigate the critical behavior of evolutionary social dilemmas on structured populations by using the framework of master equations and Monte Carlo simulations. The developed theory describes the existence of absorbing, quasi-absorbing, and mixed strategy states and the transition nature, continuous or discontinuous, between the states as the parameters of the system change. In particular, when the decision-making process is deterministic, in the limit of zero effective temperature of the Fermi function, we find that the copying probabilities are discontinuous functions of the system's parameters and of the network degrees sequence. This may induce abrupt changes in the final state for any system size, in excellent agreement with the Monte Carlo simulation results. Our analysis also reveals the existence of continuous and discontinuous phase transitions for large systems as the temperature increases, which is explained in the mean-field approximation. Interestingly, for some game parameters, we find optimal "social temperatures" maximizing/minimizing the cooperation frequency/density.

nlin.AO↗

arXiv2021

Predicting transitions in cooperation levels from network connectivity

Networks determine our social circles and the way we cooperate with others. We know that topological features like hubs and degree assortativity affect cooperation, and we know that cooperation is favoured if the benefit of the altruistic act divided by the cost exceeds the average number of neighbours. However, a simple rule that would predict cooperation transitions on an arbitrary network has not yet been presented. Here we show that the unique sequence of degrees in a network can be used to predict at which game parameters major shifts in the level of cooperation can be expected, including phase transitions from absorbing to mixed strategy phases. We use the evolutionary prisoner's dilemma game on random and scale-free networks to demonstrate the prediction, as well as its limitations and possible pitfalls. We observe good agreements between the predictions and the results obtained with concurrent and Monte Carlo methods for the update of the strategies, thus providing a simple and fast way to estimate the outcome of evolutionary social dilemmas on arbitrary networks without the need of actually playing the game.

physics.soc-ph↗

arXiv2021

Evolutionary games on simplicial complexes

Elucidating the mechanisms that lead to cooperation is still one of the main scientific challenges of current times, as many common cooperative scenarios remain elusive and at odds with Darwin's natural selection theory. Here, we study evolutionary games on populations that are structured beyond pairwise interactions. Specifically, we introduce a general evolutionary approach that allows studying situations in which indirect interactions via a neighbor other than the direct pairwise connection (or via a group of neighbors), impact the strategy of the focal player. To this end, we consider simplicial graphs that encode two- and three-body interactions, which enables to study competition between all possible pairs of social dilemmas and to scrutinize the role of three-body interactions in all the observed phenomenology. We simultaneously investigate how social dilemma with different Nash equilibria compete in simplicial structures and how such a competition is modulated by the unbalance of 2- and 1-simplices, which in its turn reflects the relative prevalence of pairwise or group interactions among the players. We report a number of results that: (i) support that higher-order games allow for non-dominant strategists to emerge and coexist with dominant ones, a scenario that can't be explained by any pairwise schemes, no matter the network of contacts; (ii) characterize a novel transition from dominant defection to dominant cooperation as a function of the simplicial structure of the population; and (iii) demonstrate that 2-simplex interactions are a source of strategy diversity, i.e. increasing the relative prevalence of group interactions always promotes diverse strategic identities of individuals. Our study constitutes a step forward in the quest for understanding the roots of cooperation and the mechanisms that sustain it in real-world and social environments.

physics.soc-ph↗

arXiv2020

Growing scale-free simplices

The past two decades have seen significant successes in our understanding of complex networked systems, from the mapping of real-world social, biological and technological networks to the establishment of generative models recovering their observed macroscopic patterns. These advances, however, are restricted to pairwise interactions, captured by dyadic links, and provide limited insight into higher-order structure, in which a group of several components represents the basic interaction unit. Such multi-component interactions can only be grasped through simplicial complexes, which have recently found applications in social and biological contexts, as well as in engineering and brain science. What, then, are the generative models recovering the patterns observed in real-world simplicial complexes? Here we introduce, study, and characterize a model to grow simplicial complexes of order two, i.e. nodes, links and triangles, that yields a highly flexible range of empirically relevant simplicial network ensembles. Specifically, through a combination of preferential and/or non preferential attachment mechanisms, the model constructs networks with a scale-free degree distribution and an either bounded or scale-free generalized degree distribution - the latter accounting for the number of triads surrounding each link. Allowing to analytically control the scaling exponents we arrive at a highly general scheme by which to construct ensembles of synthetic complexes displaying desired statistical properties.

physics.soc-ph↗

arXiv2020

Diverse strategic identities induce dynamical states in evolutionary games

Evolutionary games provide the theoretical backbone for many aspects of our social life: from cooperation to crime, from climate inaction to imperfect vaccination and epidemic spreading, from antibiotics overuse to biodiversity preservation. An important, and so far overlooked, aspect of reality is the diverse strategic identities of individuals. While applying the same strategy to all interaction partners may be an acceptable assumption for simpler forms of life, this fails to account} for the behavior of more complex living beings. For instance, we humans act differently around different people. Here we show that allowing individuals to adopt different strategies with different partners yields a very rich evolutionary dynamics, including time-dependent coexistence of cooperation and defection, system-wide shifts in the dominant strategy, and maturation in individual choices. Our results are robust to variations in network type and size, and strategy updating rules. Accounting for diverse strategic identities thus has far-reaching implications in the mathematical modeling of social games.

physics.soc-ph↗

arXiv2020

Dynamical complexity measure to distinguish organized from disorganized dynamics

We propose a metric to characterize the complex behavior of a dynamical system and to distinguish between organized and disorganized complexity. The approach combines two quantities that separately assess the degree of unpredictability of the dynamics and the lack of describability of the structure in the Poincaré plane constructed from a given time series. As for the former, we use the permutation entropy $S_{\rm p}$, while for the later, we introduce an indicator, the {\em structurality} $Δ$, which accounts for the fraction of visited points in the Poincaré plane. The complexity measure thus defined as the sum of those two components is validated by classifying in the ($S_{\rm p}$,$Δ$) space the complexity of several benchmark dissipative and conservative dynamical systems. As an application, we show how the metric can be used as a powerful biomarker for different cardiac pathologies and to distinguish the dynamical complexity of two electrochemical dissolutions.

physics.soc-ph↗

arXiv2018

Dynamical complexity as a proxy for the network degree distribution

We explore the relation between the topological relevance of a node in a complex network and the individual dynamics it exhibits. When the system is weakly coupled, the effect of the coupling strength against the dynamical complexity of the nodes is found to be a function of their topological role, with nodes of higher degree displaying lower levels of complexity. We provide several examples of theoretical models of chaotic oscillators, pulse-coupled neurons and experimental networks of nonlinear electronic circuits evidencing such a hierarchical behavior. Importantly, our results imply that it is possible to infer the degree distribution of a network only from individual dynamical measurements.

nlin.CD↗

arXiv2017

Relay synchronization in multiplex networks

Relay (or remote) synchronization between two not directly connected oscillators in a network is an important feature allowing distant coordination. In this work, we report a systematic study of this phenomenon in multiplex networks, where inter-layer synchronization occurs between distant layers mediated by a relay layer that acts as a transmitter. We show that this transmission can be extended to higher order relay configurations, provided symmetry conditions are preserved. By first order perturbative analysis, we identify the dynamical and topological dependencies of relay synchronization in a multiplex. We find that the relay synchronization threshold is considerably reduced in a multiplex configuration, and that such synchronous state is mostly supported by the lower degree nodes of the outer layers, while hubs can be de-multiplexed without affecting overall coherence. Finally, we experimentally validated the analytical and numerical findings by means of a multiplex of three layers of electronic circuits.the analytical and numerical findings by means of a multiplex of three layers of electronic circuits.

nlin.CD↗

arXiv2016

Inter-layer synchronization in non-identical multi-layer networks

Inter-layer synchronization is a dynamical state occurring in multi-layer networks composed of identical nodes. The state corresponds to have all layers synchronized, with nodes in each layer which do not necessarily evolve in unison. So far, the study of such a solution has been restricted to the case in which all layers had an identical connectivity structure. When layers are not identical, the inter-layer synchronous state is no longer a stable solution of the system. Nevertheless, when layers differ in just a few links, an approximate treatment is still feasible, and allows one to gather information on whether and how the system may wander around an inter-layer synchronous configuration. We report the details of an approximate analytical treatment for a two-layer multiplex, which results in the introduction of an extra inertial term accounting for structural differences. Numerical validation of the predictions highlights the usefulness of our approach, especially for small or moderate topological differences in the intra-layer coupling. Moreover, we identify a non-trivial relationship between the betweenness centrality of the missing links and the intra-layer coupling strength. Finally, by the use of two multiplexed identical layers of electronic circuits in a chaotic regime, we study the loss of inter-layer synchronization as a function of the betweenness centrality of the removed links.

nlin.AO↗

arXiv2016

Explosive transitions in complex networks' structure and dynamics: percolation and synchronization

Percolation and synchronization are two phase transitions that have been extensively studied since already long ago. A classic result is that, in the vast majority of cases, these transitions are of the second-order type, i.e. continuous and reversible. Recently, however, explosive phenomena have been reported in com- plex networks' structure and dynamics, which rather remind first-order (discontinuous and irreversible) transitions. Explosive percolation, which was discovered in 2009, corresponds to an abrupt change in the network's structure, and explosive synchronization (which is concerned, instead, with the abrupt emergence of a collective state in the networks' dynamics) was studied as early as the first models of globally coupled phase oscillators were taken into consideration. The two phenomena have stimulated investigations and de- bates, attracting attention in many relevant fields. So far, various substantial contributions and progresses (including experimental verifications) have been made, which have provided insights on what structural and dynamical properties are needed for inducing such abrupt transformations, as well as have greatly enhanced our understanding of phase transitions in networked systems. Our intention is to offer here a monographic review on the main-stream literature, with the twofold aim of summarizing the existing results and pointing out possible directions for future research.

nlin.AO↗

arXiv2016

Assortativity and leadership emergence from anti-preferential attachment in heterogeneous networks

Many real-world networks exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Particularly in social networks, the contribution to the total assortativity varies with degree, featuring a distinctive peak slightly past the average degree. The way traditional models imprint assortativity on top of pre-defined topologies is via degree-preserving link permutations, which however destroy the particular graph's hierarchical traits of clustering. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties and tunable realistic assortativity. In our approach, two distinct populations of nodes are added to an initial network seed: one (the followers) that abides by usual preferential rules, and one (the potential leaders) connecting via anti-preferential attachments, i.e. selecting lower degree nodes for their initial links. The latter nodes come to develop a higher average degree, and convert eventually into the final hubs. Examining the evolution of links in Facebook, we present empirical validation for the connection between the initial anti-preferential attachment and long term high degree. Thus, our work sheds new light on the structure and evolution of social networks.

physics.soc-ph↗

arXiv2015

Inter-layer synchronization in multiplex networks

Inter-layer synchronization is a distinctive process of multiplex networks whereby each node in a given layer undergoes a synchronous evolution with all its replicas in other layers, irrespective of whether or not it is synchronized with the other units of the same layer. We analytically derive the necessary conditions for the existence and stability of inter-layer synchronization, and verify numerically the analytical predictions in several cases where such a state emerges. We inspect the impact of the layer topology on the robustness of such a state against a progressive de-multiplexing of the network. Finally, we provide experimental evidence by means of multiplexes of nonlinear electronic circuits, showing the stability of the synchronized manifold despite the intrinsic noise and parameter mismatch in the experiment.

nlin.AO↗

arXiv2015

Synchronization centrality and explosive synchronization in complex networks

Synchronization of networked oscillators is known to depend fundamentally on the interplay between the dynamics of the graph's units and the microscopic arrangement of the network's structure. For non identical elements, the lack of quantitative tools has hampered so far a systematic study of the mechanisms behind such a collective behavior. We here propose an effective network whose topological properties reflect the interplay between the topology and dynamics of the original network. On that basis, we are able to introduce the "synchronization centrality", a measure which quantifies the role and importance of each network's node in the synchronization process. In particular, we use such a measure to assess the propensity of a graph to synchronize explosively, thus indicating a unified framework for most of the different models proposed so far for such an irreversible transition. Taking advantage of the predicting power of this measure, we furthermore discuss a strategy to induce the explosive behavior in a generic network, by acting only upon a small fraction of its nodes.

nlin.AO↗

arXiv2014

Assortative mixing enhances the irreversible nature of explosive synchronization in growing scale-free networks

We discuss the behavior of large ensembles of phase oscillators networking via scale-free topologies in the presence of a positive correlation between the oscillators' natural frequencies and network's degrees. In particular, we show that the further presence of degree-degree correlation in the network structure has important consequences on the nature of the phase transition characterizing the passage from the phase-incoherent to the phase-coherent network's state. While high levels of positive and negative mixing consistently induce a second-order phase transition, moderate values of assortative mixing, such as those ubiquitously characterizing social networks in the real world, greatly enhance the irreversible nature of explosive synchronization in growing scale-free networks. This latter effect corresponds to a maximization of the area and of the width of the hysteretic loop that differentiates the forward and backward transitions to synchronization.

nlin.AO↗

arXiv2014

The structure and dynamics of multilayer networks

In the past years, network theory has successfully characterized the interaction among the constituents of a variety of complex systems, ranging from biological to technological, and social systems. However, up until recently, attention was almost exclusively given to networks in which all components were treated on equivalent footing, while neglecting all the extra information about the temporal- or context-related properties of the interactions under study. Only in the last years, taking advantage of the enhanced resolution in real data sets, network scientists have directed their interest to the multiplex character of real-world systems, and explicitly considered the time-varying and multilayer nature of networks. We offer here a comprehensive review on both structural and dynamical organization of graphs made of diverse relationships (layers) between its constituents, and cover several relevant issues, from a full redefinition of the basic structural measures, to understanding how the multilayer nature of the network affects processes and dynamics.

physics.soc-ph↗

arXiv2013

Explosive synchronization in weighted complex networks

The emergence of dynamical abrupt transitions in the macroscopic state of a system is currently a subject of the utmost interest. Given a set of phase oscillators networking with a generic wiring of connections and displaying a generic frequency distribution, we show how combining dynamical local information on frequency mismatches and global information on the graph topology suggests a judicious and yet practical weighting procedure which is able to induce and enhance explosive, irreversible, transitions to synchronization. We report extensive numerical and analytical evidence of the validity and scalability of such a procedure for different initial frequency distributions, for both homogeneous and heterogeneous networks, as well as for both linear and non linear weighting functions. We furthermore report on the possibility of parametrically controlling the width and extent of the hysteretic region of coexistence of the unsynchronized and synchronized states.

nlin.AO↗