Biomedical subjects

Víctor M Eguíluz

Publications and source records attributed to Víctor M Eguíluz.

10 recordsLinked to original sources

PubMed2005

Cooperation, social networks, and the emergence of leadership in a prisoner's dilemma with adaptive local interactions.

Cooperative behavior among a group of agents is studied assuming adaptive interactions. Each agent plays a Prisoner's Dilemma game with its local neighbors, collects an aggregate payoff, and imitates the strategy of its best neighbor. Agents may punish or reward their neighbors by removing or sustaining the interactions, according to their satisfaction level and strategy played. An agent may dismiss an interaction, and the corresponding neighbor is replaced by another randomly chosen agent, introducing diversity and evolution to the network structure. We perform an extensive numerical and analytical study, extending results in M. G. Zimmermann, V. M. Eguíluz, and M. San Miguel, Phys. Rev. E 69, 065102(R) (2004). We show that the system typically reaches either a full-defective state or a highly cooperative steady state. The latter equilibrium solution is composed mostly by cooperative agents, with a minor population of defectors that exploit the cooperators. It is shown how the network adaptation dynamics favors the emergence of cooperators with the highest payoff. These "leaders" are shown to sustain the global cooperative steady state. Also we find that the average payoff of defectors is larger than the average payoff of cooperators. Whenever "leaders" are perturbed (e.g., by addition of noise), an unstable situation arises and global cascades with oscillations between the nearly full defection network and the fully cooperative outcome are observed.

Journal Article↗

PubMed2005

Voter model dynamics in complex networks: Role of dimensionality, disorder, and degree distribution.

We analyze the ordering dynamics of the voter model in different classes of complex networks. We observe that whether the voter dynamics orders the system depends on the effective dimensionality of the interaction networks. We also find that when there is no ordering in the system, the average survival time of metastable states in finite networks decreases with network disorder and degree heterogeneity. The existence of hubs, i.e., highly connected nodes, in the network modifies the linear system size scaling law of the survival time. The size of an ordered domain is sensitive to the network disorder and the average degree, decreasing with both; however, it seems not to depend on network size and on the heterogeneity of the degree distribution.

Journal Article↗

PubMed2005

Scaling in the structure of directory trees in a computer cluster.

We describe the topological structure and the underlying organization principles of the directories created by users of a computer cluster. Users create trees with a scale-free degree distribution whose properties are reproduced by a growth and preferential attachment mechanism with a single parameter. The degree distribution has a nonuniversal exponent associated with different values of the parameter. However, the distribution of branch sizes has a universal exponent analytically obtained from the model.

Journal Article↗

PubMed2004

Coevolution of dynamical states and interactions in dynamic networks.

We explore the coupled dynamics of the internal states of a set of interacting elements and the network of interactions among them. Interactions are modeled by a spatial game and the network of interaction links evolves adapting to the outcome of the game. As an example, we consider a model of cooperation in which the adaptation is shown to facilitate the formation of a hierarchical interaction network that sustains a highly cooperative stationary state. The resulting network has the characteristics of a small world network when a mechanism of local neighbor selection is introduced in the adaptive network dynamics. The highly connected nodes in the hierarchical structure of the network play a leading role in the stability of the network. Perturbations acting on the state of these special nodes trigger global avalanches leading to complete network reorganization.

Journal Article↗

PubMed2003

Effective dimensions and percolation in hierarchically structured scale-free networks.

We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial character of this network that displays scale-free connectivity among other features, it turns out to be approximately one dimensional. The dimensional characterization is in agreement with the results on statistics of site percolation and other dynamical processes implemented on such a network.

Journal Article↗

PubMed2003

Global culture: a noise-induced transition in finite systems.

We analyze the effect of cultural drift, modeled as noise, in Axelrod's model for the dissemination of culture. The disordered multicultural frozen configurations are found not to be stable. This general result is proven rigorously in d=1, where the dynamics is described in terms of a Lyapunov potential. In d=2, the dynamics is governed by the average relaxation time T of perturbations. Noise at a rate r or =T(-1) sustains disorder. In the thermodynamic limit, the relaxation time diverges and global polarization persists in spite of a dynamics of local convergence.

Journal Article↗

PubMed2003

Nonequilibrium transitions in complex networks: a model of social interaction.

We analyze the nonequilibrium order-disorder transition of Axelrod's model of social interaction in several complex networks. In a small-world network, we find a transition between an ordered homogeneous state and a disordered state. The transition point is shifted by the degree of spatial disorder of the underlying network, the network disorder favoring ordered configurations. In random scale-free networks the transition is only observed for finite size systems, showing system size scaling, while in the thermodynamic limit only ordered configurations are always obtained. Thus, in the thermodynamic limit the transition disappears. However, in structured scale-free networks, the phase transition between an ordered and a disordered phase is restored.

Journal Article↗

PubMed2002

Epidemic threshold in structured scale-free networks.

We analyze the spreading of viruses in scale-free networks with high clustering and degree correlations, as found in the Internet graph. For the susceptible-infected-susceptible model of epidemics the prevalence undergoes a phase transition at a finite threshold of the transmission probability. Comparing with the absence of a finite threshold in networks with purely random wiring, our result suggests that high clustering (modularity) and degree correlations protect scale-free networks against the spreading of viruses. We introduce and verify a quantitative description of the epidemic threshold based on the connectivity of the neighborhoods of the hubs.

Disease Outbreaks↗

PubMed2002

Growing scale-free networks with small-world behavior.

In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small-world effect. While the average shortest path length increases logarithmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive analytical expressions for the clustering coefficient in two limiting cases: random [C approximately (ln N)(2)/N] and highly clustered (C=5/6) scale-free networks.

Journal Article↗

PubMed2002

Highly clustered scale-free networks.

We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power-law distribution of degree, linear preferential attachment of new links, and a negative correlation between the age of a node and its link attachment rate. Notably, the degree distribution is conserved even though only the most recently grown part of the network is considered. As the network grows, the clustering reaches an asymptotic value larger than that for regular lattices of the same average connectivity and similar to the one observed in the networks of movie actors, coauthorship in science, and word synonyms. These highly clustered scale-free networks indicate that memory effects are crucial for a correct description of the dynamics of growing networks.

Journal Article↗