We address how the structure of a social communication system affects language coordination. The naming game is an abstraction of lexical acquisition dynamics, in which N agents try to find an agreement on the names to give to objects. Most results on naming games are specific to certain communication network topologies. We present two important results that are general to any graph topology: the first proves that under certain topologies the system always converges to a name-object agreement; the second proves that if these conditions are not met the system may end up in a state in which sub-networks with different competing object-name associations coexist. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gosti, G., & Batchelder, W. H. (2011). Naming on a directed graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6589 LNCS, pp. 358–365). https://doi.org/10.1007/978-3-642-19656-0_49
Mendeley helps you to discover research relevant for your work.