Related papers: Agreement dynamics on small-world networks
We introduce a model of negotiation dynamics whose aim is that of mimicking the mechanisms leading to opinion and convention formation in a population of individuals. The negotiation process, as opposed to ``herding-like'' or ``bounded…
We propose a simple adaptive-network model describing recent swarming experiments. Exploiting an analogy with human decision making, we capture the dynamics of the model by a low-dimensional system of equations permitting analytical…
We investigate in detail a recent model of colliding mobile agents [Phys. Rev. Lett.~96, 088702], used as an alternative approach to construct evolving networks of interactions formed by the collisions governed by suitable dynamical rules.…
Many real world networks are characterized by adaptive changes in their topology depending on the dynamic state of their nodes. Here we study epidemic dynamics in an adaptive network, where susceptibles are able to avoid contact with…
We consider two social consensus models, the AB-model and the Naming Game restricted to two conventions, which describe a population of interacting agents that can be in either of two equivalent states (A or B) or in a third mixed (AB)…
Feature maps, that preserve the global topology of arbitrary datasets, can be formed by self-organizing competing agents. So far, it has been presumed that global interaction of agents is necessary for this process. We establish that this…
Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph…
Agent-based models are a natural choice for modeling complex social systems. In such models simple stochastic interaction rules for a large population of individuals can lead to emergent dynamics on the macroscopic scale, for instance a…
In this paper, we investigate asymptotic properties of a consensus protocol taking place in a class of temporal (i.e., time-varying) networks called the activity driven network. We first show that a standard methodology provides us with an…
The advantages of temporal networks in capturing complex dynamics, such as diffusion and contagion, has led to breakthroughs in real world systems across numerous fields. In the case of human behavior, face-to-face interaction networks…
The transition to turbulence via spatiotemporal intermittency is investigated in the context of coupled maps defined on small-world networks. The local dynamics is given by the Chat\'e-Manneville minimal map previously used in studies of…
We propose a minority route choice game to investigate the effect of the network structure on traffic network performance under the assumption of drivers' bounded rationality. We investigate ring-and-hub topologies to capture the nature of…
The influence of networks topology on collective properties of dynamical systems defined upon it is studied in the thermodynamic limit. A network model construction scheme is proposed where the number of links, the average eccentricity and…
The ability to achieve coordinated behavior --engineered or emergent-- on networked systems has attracted widespread interest over several fields. This has led to remarkable advances on the development of a theoretical understanding of the…
We study in detail the role of short-cuts in promoting the emergence of cooperation in a network of agents playing the Prisoner's Dilemma Game (PDG). We introduce a model whose topology interpolates between the one-dimensional euclidean…
In this paper, we study the continuous-time consensus problem in the presence of adversaries. The networked multi-agent system is modeled as a switched system, where the normal agents have integrator dynamics and the switching signal…
We study a modified version of the Naming Game, a recently introduced model which describes how shared vocabulary can emerge spontaneously in a population without any central control. In particular, we introduce a new mechanism that allows…
We model a system of networking agents that seek to optimize their centrality in the network while keeping their cost, the number of connections they are participating in, low. Unlike other game-theory based models for network evolution,…
We study a discrete-time consensus model in which agents iteratively update their states through interactions on a dynamic social network. At each step, a single agent is selected asynchronously and averages the values of its current…
In decentralized optimization, nodes cooperate to minimize an overall objective function that is the sum (or average) of per-node private objective functions. Algorithms interleave local computations with communication among all or a subset…