Nonequilibrium dynamics of language games on complex networks.

  title={Nonequilibrium dynamics of language games on complex networks.},
  author={Luca Dall’Asta and Andrea Baronchelli and Alain Barrat and Vittorio Loreto},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={74 3 Pt 2},
The naming game is a model of nonequilibrium dynamics for the self-organized emergence of a linguistic convention or a communication system in a population of agents with pairwise local interactions. We present an extensive study of its dynamics on complex networks, that can be considered as the most natural topological embedding for agents involved in language games and opinion dynamics. Except for some community structured networks on which metastable phases can be observed, agents playing… 

Agreement dynamics on interaction networks with diverse topologies.

We review the behavior of a recently introduced model of agreement dynamics, called the "Naming Game." This model describes the self-organized emergence of linguistic conventions and the

Agreement dynamics of finite-memory language games on networks

A robust scaling property of the convergence time, which is regardless of the network structure and the memory restriction, is reported, which clearly explain the nontrivial behaviors of the converge.

Topological Aspects of the Multi-Language Phases of the Naming Game on Community-Based Networks

It is shown that metastable states correspond to genuine multi-language phases, emerging in the thermodynamic limit when the fraction of links connecting communities drops below critical thresholds.

Microscopic activity patterns in the Naming Game

The internal agent dynamics of the naming game in populations embedded on networks is analysed, finding that it strongly depends on very general topological properties of the system (e.g. average and fluctuations of the degree).

Artificial language evolution on a dynamical interaction network

This dissertation studies the impact of a dynamical interaction network on the distributed learning of a common language. We derive a new algorithm for generating realistic complex networks, called

Accelerating Consensus by Preferential Words in the Naming Game

The naming game is a model of nonequilibrium dynamics for the self-organized emergence of a language or a communication system. We study a modified version of the minimal naming game in which the

Role of connectivity-induced weighted words in language games.

A tunable parameter is introduced, governing the word weight based on the connectivity of agents, and it is found that there exists an optimal parameter value, leading to the fastest convergence.

On the evolutionary language game in structured and adaptive populations

An evolutionary model for the emergence of shared linguistic convention in a population of agents whose social structure is modelled by complex networks is proposed, and a process of convergence towards a common language is shown and how the topology of the underlying networks affects its dynamics is explored.

Opinion formation in time-varying social networks: The case of Naming Game

A computational exploration of the dynamics of the naming game as an opinion formation model on time-varying social networks using simulations on top of real networks finds that networks with strong community structure hinder the system from reaching global agreement.



Topology Induced Coarsening in Language Games

It is highlighted that in low dimensions consensus is reached through a coarsening process that requires less cognitive effort of the agents, with respect to the mean-field case, but takes longer to complete.

Agreement dynamics on small-world networks

The effect of a non-trivial topology on the dynamics of the so-called Naming Game, a recently introduced model which addresses the issue of how shared conventions emerge spontaneously in a population of agents, is analyzed.

Collective dynamics of ‘small-world’ networks

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

Interface motion and pinning in small-world networks.

It is shown that the nonequilibrium dynamics of systems with many interacting elements located on a small-world network can be much slower than on regular networks, analogous to random field models.

Dynamics of majority rule in two-state interacting spin systems.

A two-state opinion dynamics model where agents evolve by majority rule is introduced, where a group of agents is specified whose members then all adopt the local majority state.

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

The ordering dynamics of the voter model in different classes of complex networks is analyzed, finding that whether the voter dynamics orders the system depends on the effective dimensionality of the interaction networks and the average survival time of metastable states in finite networks decreases with network disorder and degree heterogeneity.

Statistical mechanics of complex networks

A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.

Comparison of voter and Glauber ordering dynamics on networks.

It is found that the zero-temperature Glauber dynamics for the Ising model may get trapped in sets of partially ordered metastable states even for finite system size, and this becomes more probable as the size increases.

Incomplete ordering of the voter model on small-world networks

It is shown that the voter model on small-world networks does not display the emergence of complete order in the thermodynamic limit, and the nontrivial connectivity pattern leads to the counterintuitive conclusion that long-range connections inhibit the ordering process.

Sharp transition towards shared vocabularies in multi-agent systems

A microscopic model of communicating autonomous agents performing language games without any central control is introduced and it is shown that the system undergoes a disorder/order transition, going through a sharp symmetry breaking process to reach a shared set of conventions.