Bifurcation analysis of the fully symmetric language dynamical equation
- 98 Downloads
In this paper, I study a continuous dynamical system that describes language acquisition and communication in a group of individuals. Children inherit from their parents a mechanism to learn their language. This mechanism is constrained by a universal grammar which specifies a restricted set of candidate languages. Language acquisition is not error-free. Children may or may not succeed in acquiring exactly the language of their parents. Individuals talk to each other, and successful communication contributes to biological (or cultural) fitness. I provide a full bifurcation analysis of the case where the parameters are chosen to yield a highly symmetric dynamical system. Populations approach either an incoherent steady state, where many different candidate languages are represented in the population, or a coherent steady state, where the majority of the population speaks a single language. The main result of the paper is a description of how learning reliability affects the stability of these two kinds of equilibria. I rigorously find all fixed points, determine their stabilities, and prove that all populations tend to some fixed point. I also demonstrate that the fixed point representing an incoherent steady state becomes unstable in an 𝒮 n -symmetric transcritical bifurcation as learning becomes more reliable.
KeywordsSteady State Dynamical System Dynamical Equation Language Acquisition Bifurcation Analysis
Unable to display preview. Download preview PDF.