Abstract:The differential equations of Abrams and Strogatz for the competition between two languages are compared with agent-based Monte Carlo simulations for fully connected networks as well as for lattices in one, two and three dimensions, with up to 10 9 agents.Keywords: Monte Carlo, language competition Many computer studies of the competition between different languages, triggered by Abrams and Strogatz [1], have appeared mostly in physics journals using differential equations (mean field approximation [2, 3, 4, 5]) or agent-based simulations for many [6,7,8,9] or few [10, 11] languages. A longer review is given in [12], a shorter one in [13]. We check in this note to what extent the results of the mean field approximation are confirmed by agent-based simulations with many individuals. We do not talk here about the learning of languages [14,15].The Abrams-Strogatz differential equation for the competition of a language Y with higher social status 1 − s against another language X with lower social status s iswhere a ≃ 1.3 [1] and 0 < s ≤ 1/2. Here x is the fraction in the population speaking language X with lower social status s while the fraction 1−x speaks language Y. As initial condition we consider the situation in which both languages have the same number of speakers, x(t = 0) = 1/2. Figure 1 shows exponential decay for a = 1.31 as well as for the simpler linear case a = 1. For s = 1/2 the symmetric situation x = 1/2 is a stationary solution 1