Abstract
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 speaker selects a word from its inventory with a probability proportional to exp(Rs * α), where Rs is the success ratio of the name and α is a tunable parameter. By investigating the effects of α on the evolutionary processes for both square lattice and scale-free networks, we find that the convergence time decreases with the increasing α on both two networks, which indicates that preferential selection of successful words can accelerate the reaching of consensus. More interestingly, for α > 0, we find that the relation between convergence time and α exhibits a power-law form.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
