Abstract
Complex networks are commonly employed as the underlying communication structures in naming game studies, especially random-graph (RG), small-world (SW), and scale-free (SF) networks [1, 2, 3, 4, 5]. As can be seen from the previous chapters, different network topologies affect the naming game process significantly in different ways. Naming game simulations and analysis offer an effective computer-aided approach to building sensible mathematical models and, more importantly, better understanding of the evolution and development of human languages and social behaviors. The convergence phenomena in naming game models are typically verified via numerical simulations [6, 7, 8], theoretical proofs [9], and sometimes social experiments [10].
Sign-in/Register to access full text options 
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.
