Related papers: Agreement dynamics on small-world networks

Real growing networks like the WWW or personal connection based networks are characterized by a high degree of clustering, in addition to the small-world property and the absence of a characteristic scale. Appropriate modifications of the…

According to the May-Wigner stability theorem, increasing the complexity of a network inevitably leads to its destabilization, such that a small perturbation will be able to disrupt the entire system. One of the principal arguments against…

This work develops the concept of temporal network epistemology model enabling the simulation of the learning process in dynamic networks. The results of the research, conducted on the temporal social network generated using the CogSNet…

Recently a distributed algorithm has been proposed for multi-agent networks to solve a system of linear algebraic equations, by assuming each agent only knows part of the system and is able to communicate with nearest neighbors to update…

Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. Using a high-degree expansion of the master equation, we…

We live in a world full of networks where our economy, our communication, and even our social life crucially depends on them. These networks typically emerge from the interaction of many entities, which is why researchers study agent-based…

The Naming Game is a classic model for studying the emergence and evolution of language within a population. In this paper, we extend the traditional Naming Game model to encompass multiple committed opinions and investigate the system…

In social dilemmas, most interactions are transient and susceptible to restructuring, leading to continuous changes in social networks over time. Typically, agents assess the rewards of their current interactions and adjust their…

In this article, we investigate the asymptotic formation of consensus for several classes of time-dependent cooperative graphon dynamics. After motivating the use of this type of macroscopic models to describe multi-agent systems, we adapt…

We revisit two evolutionary game theory models, namely the Prisoner and the Snowdrift dilemmas, on top of small-world networks. These dynamics on networked populations (individuals occupying nodes of a graph) are mainly concerning on the…

In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…

To provide a phenomenological theory for the various interesting transitions in restructuring networks we employ a statistical mechanical approach with detailed balance satisfied for the transitions between topological states. This enables…

We investigate the behavior of a simple majority dynamics on networks of agents whose interaction topology exhibits a community structure. By leveraging recent advancements in the analysis of dynamics, we prove that, when the states of the…

In this work we present an analysis of a spatially non homogeneous ultimatum game. By considering different underlying topologies as substrates on top of which the game takes place we obtain nontrivial behaviors for the evolution of the…

This paper explores the emergence of norms in agents' societies when agents play multiple -even incompatible- roles in their social contexts simultaneously, and have limited interaction ranges. Specifically, this article proposes two…

We analyze Axelrod's model of social interactions on coevolving complex networks. We introduce four extensions with different mechanisms of edge rewiring. The models are intended to catch two kinds of interactions - preferential attachment,…

We investigate consensus formation and the asymptotic consensus times in stylized individual- or agent-based models, in which global agreement is achieved through pairwise negotiations with or without a bias. Considering a class of…

Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains…

The ability to achieve coordinated behavior -- engineered or emergent -- on networked systems has attracted widespread interest over several fields. This interest has led to remarkable advances in developing a theoretical understanding of…

In this paper, we study proximal type dynamics in the context of noncooperative multi-agent network games. These dynamics arise in different applications, since they describe distributed decision making in multi-agent networks, e.g., in…