Muutke küpsiste eelistusi

Naming Game: Models, Simulations and Analysis 2019 ed. [Kõva köide]

  • Formaat: Hardback, 158 pages, kõrgus x laius: 235x155 mm, kaal: 454 g, 70 Illustrations, color; 19 Illustrations, black and white; IX, 158 p. 89 illus., 70 illus. in color., 1 Hardback
  • Sari: Emergence, Complexity and Computation 34
  • Ilmumisaeg: 17-Dec-2018
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030052427
  • ISBN-13: 9783030052423
Teised raamatud teemal:
  • Kõva köide
  • Hind: 95,02 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 111,79 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 158 pages, kõrgus x laius: 235x155 mm, kaal: 454 g, 70 Illustrations, color; 19 Illustrations, black and white; IX, 158 p. 89 illus., 70 illus. in color., 1 Hardback
  • Sari: Emergence, Complexity and Computation 34
  • Ilmumisaeg: 17-Dec-2018
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030052427
  • ISBN-13: 9783030052423
Teised raamatud teemal:
This book provides a gradual introduction to the naming game, starting from the minimal naming game, where the agents have infinite memories (Chapter 2), before moving on to various new and advanced settings: the naming game with agents possessing finite-sized memories (Chapter 3); the naming game with group discussions (Chapter 4); the naming game with learning errors in communications (Chapter 5) ; the naming game on multi-community networks (Chapter 6) ; the naming game with multiple words or sentences (Chapter 7) ; and the naming game with multiple languages (Chapter 8). Presenting the authors own research findings and developments, the book provides a solid foundation for future advances. This self-study resource is intended for researchers, practitioners, graduate and undergraduate students in the fields of computer science, network science, linguistics, data engineering, statistical physics, social science and applied mathematics. 















  

Arvustused

Researchers who wish to reproduce the results presented in the book by their own computer codes might find this monograph very useful, as it is accompanied by several tables containing detailed information about the simulation settings and the numerical results, as well as a large number of plots about the outputs obtained by the authors in silico experiments. (Gionni Marchetti, zbMATH 1512.91002, 2023)

The audience for this book interested in the naming game either as a starting point for their research or as a detailed guide to create independent simulations. For its intended audience, however, this monograph contains high quality information, clearly explained and well organized. Summing Up: Recommended. Graduate students, researchers, and professionals. (L. Benedicenti, Choice, Vol. 56 (12), August, 2019)

1 Introduction
1(10)
1.1 Background
1(3)
1.2 Development Towards Applications
4(2)
1.3 Abbreviations
6(1)
1.4 Layout of the Monograph
6(1)
References
7(4)
2 Preliminaries
11(12)
2.1 Complex Networks
11(5)
2.1.1 ER Random-Graph Network Model
11(2)
2.1.2 WS Small-World Network Model
13(1)
2.1.3 BA Scale-Free Network Model
14(1)
2.1.4 Multi-Local-World Network Model
15(1)
2.2 Naming Game
16(6)
2.2.1 Naming Game Framework
16(3)
2.2.2 Minimal Naming Game
19(3)
References
22(1)
3 Finite-Memory Naming Game
23(20)
3.1 Introduction
23(1)
3.2 Finite-Memory Naming Game
24(2)
3.3 Simulation Results
26(15)
3.3.1 Simulation Settings
26(3)
3.3.2 Convergence Time
29(3)
3.3.3 Memory Loss
32(1)
3.3.4 Convergence Process
33(8)
3.4 Conclusion
41(1)
References
41(2)
4 Naming Game with Multi-Hearers or Group Discussions
43(28)
4.1 Introduction
43(2)
4.2 Multi-Hearer Naming Game
45(4)
4.3 Naming Game with Group Discussions
49(6)
4.3.1 Group Formation and Transmitted-Words
50(2)
4.3.2 Words Transmission
52(3)
4.4 Simulation Results
55(15)
4.4.1 General Convergence Process of MHNG
55(1)
4.4.2 Convergence Time of MHNG
56(3)
4.4.3 Peak of Convergence Curve of MHNG
59(2)
4.4.4 General Convergence Process of NGG
61(3)
4.4.5 Convergence Time Analysis
64(6)
4.5 Conclusion
70(1)
References
70(1)
5 Communications with Learning Errors
71(24)
5.1 Introduction
71(1)
5.2 Communications with Learning Errors
72(4)
5.3 Simulation Results
76(15)
5.3.1 Simulation Setup
77(1)
5.3.2 Convergence Processes
78(4)
5.3.3 Convergence Time
82(1)
5.3.4 Maximum Number of Total and Different Words
83(4)
5.3.5 Convergence Thresholds
87(4)
5.4 Conclusion
91(2)
References
93(2)
6 Naming Game on Multi-Community Networks
95(20)
6.1 Introduction
95(2)
6.2 Multi-Local-World Networks
97(2)
6.3 Simulation Results and Analysis
99(13)
6.3.1 Convergence Time Versus Number and Sizes of Local-Worlds
101(4)
6.3.2 Convergence Time Versus Rate of Initially Assigned Nodes
105(2)
6.3.3 Convergence Process
107(4)
6.3.4 Discussion
111(1)
6.4 Conclusion
112(1)
References
112(3)
7 Multi-Word Naming Game
115(20)
7.1 Introduction
115(3)
7.2 Multi-Word Naming Game
118(5)
7.2.1 Conventional Sentence Patterns
119(2)
7.2.2 Local Consensus
121(2)
7.3 Simulation Results
123(10)
7.3.1 Simulation Setup
123(1)
7.3.2 Conventional English Language Patterns
124(6)
7.3.3 Man-Designed Language Patterns
130(3)
7.4 Conclusion
133(1)
References
133(2)
8 Multi-Language Naming Game
135(20)
8.1 Introduction
135(1)
8.2 Multi-Language Naming Game
136(4)
8.3 Simulation Results and Analysis
140(13)
8.3.1 Simulation Settings
140(2)
8.3.2 Convergence Process and Analysis
142(3)
8.3.3 Communication Ratio
145(2)
8.3.4 Convergence Speed
147(3)
8.3.5 Maximum Numbers of Total and Different Words
150(3)
8.4 Conclusion
153(1)
References
154(1)
Conclusions 155(2)
Index 157