arXiv subjects

J. Gomez-Gardenes

Publications and source records attributed to J. Gomez-Gardenes.

15 recordsLinked to original sources

arXiv2014

k-Core percolation on multiplex networks

We generalize the theory of k-core percolation on complex networks to k-core percolation on multiplex networks, where k=(k_a, k_b, ...). Multiplex networks can be defined as networks with a set of vertices but different types of edges, a, b, ..., representing different types of interactions. For such networks, the k-core is defined as the largest sub-graph in which each vertex has at least k_i edges of each type, i = a, b, ... . We derive self-consistency equations to obtain the birth points of the k-cores and their relative sizes for uncorrelated multiplex networks with an arbitrary degree distribution. To clarify our general results, we consider in detail multiplex networks with edges of two types, a and b, and solve the equations in the particular case of ER and scale-free multiplex networks. We find hybrid phase transitions at the emergence points of k-cores except the (1,1)-core for which the transition is continuous. We apply the k-core decomposition algorithm to air-transportation multiplex networks, composed of two layers, and obtain the size of (k_a, k_b)-cores.

cond-mat.dis-nn↗

arXiv2010

Coevolution of strategies and update rules in the Prisoner's Dilemma game on complex networks

In this work we study a weak Prisonerâs Dilemma game in which both strategies and update rules are subjected to evolutionary pressure. Interactions among agents are specified by complex topologies, and we consider both homogeneous and heterogeneous situations. We consider deterministic and stochastic update rules for the strategies, which in turn may consider single links or full context when selecting agents to copy from. Our results indicate that the co-evolutionary process preserves heterogeneous networks as a suitable framework for the emergence of cooperation. Furthermore, on those networks, the update rule leading to a larger fraction, which we call replicator dynamics, is selected during co-evolution. On homogeneous networks we observe that even if replicator dynamics turns out again to be the selected update rule, the cooperation level is larger than on a fixed update rule framework. We conclude that for a variety of topologies, the fact that the dynamics coevolves with the strategies leads in general to more cooperation in the weak Prisoner's Dilemma game.

physics.soc-ph↗

arXiv2009

Evolutionary game dynamics in a growing structured population

We discuss a model for evolutionary game dynamics in a growing, network-structured population. In our model, new players can either make connections to random preexisting players or preferentially attach to those that have been successful in the past. The latter depends on the dynamics of strategies in the game, which we implement following the so-called Fermi rule such that the limits of weak and strong strategy selection can be explored. Our framework allows to address general evolutionary games. With only two parameters describing the preferential attachment and the intensity of selection, we describe a wide range of network structures and evolutionary scenarios. Our results show that even for moderate payoff preferential attachment, over represented hubs arise. Interestingly, we find that while the networks are growing, high levels of cooperation are attained, but the same network structure does not promote cooperation as a static network. Therefore, the mechanism of payoff preferential attachment is different to those usually invoked to explain the promotion of cooperation in static, already-grown networks.

physics.soc-ph↗

arXiv2009

Effects of mobility in a population of Prisoner's Dilemma players

We address the problem of how the survival of cooperation in a social system depends on the motion of the individuals. Specifically, we study a model in which Prisoner's Dilemma players are allowed to move in a two-dimensional plane. Our results show that cooperation can survive in such a system provided that both the temptation to defect and the velocity at which agents move are not too high. Moreover, we show that when these conditions are fulfilled, the only asymptotic state of the system is that in which all players are cooperators. Our results might have implications for the design of cooperative strategies in motion coordination and other applications including wireless networks.

physics.soc-ph↗

arXiv2009

Cooperation in the Prisoner's Dilemma game in Random Scale-Free Graphs

In this paper we study the cooperative behavior of agents playing the Prisoner's Dilemma game in random scale-free networks. We show that the survival of cooperation is enhanced with respect to random homogeneous graphs but, on the other hand, decreases when compared to that found in Barabási-Albert scale-free networks. We show that the latter decrease is related with the structure of cooperation. Additionally, we present a mean field approximation for studying evolutionary dynamics in networks with no degree-degree correlations and with arbitrary degree distribution. The mean field approach is similar to the one used for describing the disease spreading in complex networks, making a further compartmentalization of the strategists partition into degree-classes. We show that this kind of approximation is suitable to describe the behavior of the system for a particular set of initial conditions, such as the placement of cooperators in the higher-degree classes, while it fails to reproduce the level of cooperation observed in the numerical simulations for arbitrary initial configurations.

physics.soc-ph↗

arXiv2008

Social Network Reciprocity as a Phase Transition in Evolutionary Cooperation

In Evolutionary Dynamics the understanding of cooperative phenomena in natural and social systems has been the subject of intense research during decades. We focus attention here on the so-called "Lattice Reciprocity" mechanisms that enhance evolutionary survival of the cooperative phenotype in the Prisoner's Dilemma game when the population of darwinian replicators interact through a fixed network of social contacts. Exact results on a "Dipole Model" are presented, along with a mean-field analysis as well as results from extensive numerical Monte Carlo simulations. The theoretical framework used is that of standard Statistical Mechanics of macroscopic systems, but with no energy considerations. We illustrate the power of this perspective on social modeling, by consistently interpreting the onset of lattice reciprocity as a thermodynamical phase transition that, moreover, cannot be captured by a purely mean-field approach.

physics.soc-ph↗

arXiv2008

Scaling breakdown in flow fluctuations on complex networks

We propose a model of random diffusion to investigate flow fluctuations in complex networks. We derive an analytical law showing that the dependence of fluctuations with the mean traffic in a network is ruled by the delicate interplay of three factors, respectively of dynamical, topological and statistical nature. In particular, we demonstrate that the existence of a power-law scaling characterizing the flow fluctuations at every node in the network can not be claimed for. We show the validity of this scaling breakdown under quite general topological and dynamical situations by means of different traffic algorithms and by analyzing real data.

physics.soc-ph↗

arXiv2008

Complex cooperative networks from evolutionary preferential attachment

In spite of its relevance to the origin of complex networks, the interplay between form and function and its role during network formation remains largely unexplored. While recent studies introduce dynamics by considering rewiring processes of a pre-existent network, we study network growth and formation by proposing an evolutionary preferential attachment model, its main feature being that the capacity of a node to attract new links depends on a dynamical variable governed in turn by the node interactions. As a specific example, we focus on the problem of the emergence of cooperation by analyzing the formation of a social network with interactions given by the Prisoner's Dilemma. The resulting networks show many features of real systems, such as scale-free degree distributions, cooperative behavior and hierarchical clustering. Interestingly, results such as the cooperators being located mostly on nodes of intermediate degree are very different from the observations of cooperative behavior on static networks. The evolutionary preferential attachment mechanism points to an evolutionary origin of scale-free networks and may help understand similar feedback problems in the dynamics of complex networks by appropriately choosing the game describing the interaction of nodes.

physics.soc-ph↗

arXiv2008

Spreading of sexually transmitted diseases in heterosexual populations

The spread of sexually transmitted diseases (e.g. Chlamydia, Syphilis, Gonorrhea, HIV) across populations is a major concern for scientists and health agencies. In this context, both data collection on sexual contact networks and the modeling of disease spreading, are intensively contributing to the search for effective immunization policies. Here, the spreading of sexually transmitted diseases on bipartite scale-free graphs, representing heterosexual contact networks, is considered. We analytically derive the expression for the epidemic threshold and its dependence with the system size in finite populations. We show that the epidemic outbreak in bipartite populations, with number of sexual partners distributed as in empirical observations from national sex surveys, takes place for larger spreading rates than for the case in which the bipartite nature of the network is not taken into account. Numerical simulations confirm the validity of the theoretical results. Our findings indicate that the restriction to crossed infections between the two classes of individuals (males and females) has to be taken into account in the design of efficient immunization strategies for sexually transmitted diseases.

physics.soc-ph↗

arXiv2007

Robustness of Cooperation in the Evolutionary Prisoner's Dilemma on Complex Networks

Recent studies on the evolutionary dynamics of the Prisoner's Dilemma game in scale-free networks have demonstrated that the heterogeneity of the network interconnections enhances the evolutionary success of cooperation. In this paper we address the issue of how the characterization of the asymptotic states of the evolutionary dynamics depends on the initial concentration of cooperators. We find that the measure and the connectedness properties of the set of nodes where cooperation reaches fixation is largely independent of initial conditions, in contrast with the behavior of both the set of nodes where defection is fixed, and the fluctuating nodes. We also check for the robustness of these results when varying the degree heterogeneity along a one-parametric family of networks interpolating between the class of Erdos-Renyi graphs and the Barabasi-Albert networks.

q-bio.PE↗

arXiv2007

Dynamical Organization of Cooperation in Complex Topologies

In this Letter, we study how cooperation is organized in complex topologies by analyzing the evolutionary (replicator) dynamics of the Prisoner's Dilemma, a two-players game with two available strategies, defection and cooperation, whose payoff matrix favors defection. We show that, asymptotically, the population is partitioned into three subsets: individuals that always cooperate ({\em pure cooperators}), always defect ({\em pure defectors}) and those that intermittently change their strategy. In fact the size of the latter set is the biggest for a wide range of the "stimulus to defect" parameter. While in homogeneous random graphs pure cooperators are grouped into several clusters, in heterogeneous scale-free (SF) networks they always form a single cluster containing the most connected individuals (hubs). Our results give further insights into why cooperation in SF networks is favored.

physics.soc-ph↗

arXiv2006

Discrete Breathers in Two-Dimensional Anisotropic Nonlinear Schrodinger lattices

We study the structure and stability of discrete breathers (both pinned and mobile) in two-dimensional nonlinear anisotropic Schrodinger lattices. Starting from a set of identical one-dimensional systems we develop the continuation of the localized pulses from the weakly coupled regime (strongly anisotropic) to the homogeneous one (isotropic). Mobile discrete breathers are seen to be a superposition of a localized mobile core and an extended background of two-dimensional nonlinear plane waves. This structure is in agreement with previous results on onedimensional breather mobility. The study of the stability of both pinned and mobile solutions is performed using standard Floquet analysis. Regimes of quasi-collapse are found for both types of solutions, while another kind of instability (responsible for the discrete breather fission) is found for mobile solutions. The development of such instabilities is studied, examining typical trajectories on the unstable nonlinear manifold.

nlin.PS↗

arXiv2006

Discrete Solitons in the Salerno Model with competing nonlinearities

We consider a lattice equation (Salerno model) combining onsite self-focusing and intersite self-defocusing cubic terms, which may describe a Bose-Einstein condensate of dipolar atoms trapped in a strong periodic potential. In the continuum approximation, the model gives rise to solitons in a finite band of frequencies, with sechlike solitons near one edge, and an exact peakon solution at the other. A similar family of solitons is found in the discrete system, including a peakon; beyond the peakon, the family continues in the form of cuspons. Stability of the lattice solitons is explored through computation of eigenvalues for small perturbations, and by direct simulations. A small part of the family is unstable (in that case, the discrete solitons transform into robust pulsonic excitations); both peakons and cuspons are stable. The Vakhitov-Kolokolov criterion precisely explains the stability of regular solitons and peakons, but does not apply to cuspons. In-phase and out-of-phase bound states of solitons are also constructed. They exchange their stability at a point where the bound solitons are peakons. Mobile solitons, composed of a moving core and background, exist up to a critical value of the strength of the self-defocusing intersite nonlinearity. Colliding solitons always merge into a single pulse.

nlin.PS↗

arXiv2004

Mobile Localization in nonlinear Schrodinger lattices

Using continuation methods from the integrable Ablowitz-Ladik lattice, we have studied the structure of numerically exact mobile discrete breathers in the standard Discrete Nonlinear Schrodinger equation. We show that, away from that integrable limit, the mobile pulse is dressed by a background of resonant plane waves with wavevectors given by a certain selection rule. This background is seen to be essential for supporting mobile localization in the absence of integrability. We show how the variations of the localized pulse energy during its motion are balanced by the interaction with this background, allowing the localization mobility along the lattice.

cond-mat.soft↗

arXiv2004

Nonintegrable Schrodinger Discrete Breathers

In an extensive numerical investigation of nonintegrable translational motion of discrete breathers in nonlinear Schrodinger lattices, we have used a regularized Newton algorithm to continue these solutions from the limit of the integrable Ablowitz-Ladik lattice. These solutions are shown to be a superposition of a localized moving core and an excited extended state (background) to which the localized moving pulse is spatially asymptotic. The background is a linear combination of small amplitude nonlinear resonant plane waves and it plays an essential role in the energy balance governing the translational motion of the localized core. Perturbative collective variable theory predictions are critically analyzed in the light of the numerical results.

cond-mat.other↗