Abstract
We review several distributed, discrete time, and probabilistic models with interacting multi-agents. We discuss the basic principles together with some variants of the frog model. We also present an experimental approach, talking about implementing and checking one of the less investigated variants of the model, where the frogs die if not meeting other frogs for some time. We follow the same lines for broadcasting and gossiping models, our experimental approach checks the validity of the broadcasting time for a wide range of the number of agents existing in the system. We also study the emergent behaviour of a multi-agent system whose agents follow only several simple rules; we performed our experiments with an implementation in StarLogo.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The vertex with the coordinates (0, 0).
- 2.
Proposed by Hervé Guiol.
- 3.
Preliminary research by Fábio Machado and Lucas Meyer.
- 4.
- 5.
- 6.
References
Aldous, D.: Interacting particle systems as stochastic social dynamics. Bernoulli 19(4), 1122–1149 (2013). doi:10.3150/12-BEJSP04
Aldous, D., Fill, J.A.: Reversible markov chains and random walks on graphs (2002). (Unfinished monograph, recompiled 2014, available at http://www.stat.berkeley.edu/~aldous/RWG/book.html)
Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Schulman, L.J. (ed.) STOC, pp. 399–408. ACM (2010). doi:10.1145/1806689.1806745
Cooper, C., Frieze, A., Radzik, T.: Multiple random walks and interacting particle systems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5–12, 2009, Proceedings, Part II, pp. 399–410. Springer Berlin Heidelberg, Berlin, Heidelberg (2009). doi:10.1007/978-3-642-02930-1_33
Cooper, C., Frieze, A.M., Radzik, T.: Multiple random walks in random regular graphs. SIAM J. Discret. Math. 23(4), 1738–1761 (2009). doi:10.1137/080729542
Dembo, A., Peres, Y., Rosen, J., Zeitouni, O.: Cover times for Brownian motion and random walks in two dimensions. Ann. Math. 160, 433–464 (2004). doi:10.4007/annals.2004.160.433
Dutta, C., Pandurangan, G., Rajaraman, R., Roche, S.: Coalescing-branching random walks on graphs. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA ’13, pp. 176–185. ACM, New York, NY, USA (2013). doi:10.1145/2486159.2486197
Dyson, G.B.: Darwin Among the Machines: The Evolution of Global Intelligence. Addison-Wesley Longman Publishing Co., Inc, Boston, MA, USA (1997)
Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York, NY, USA (2010)
Erez, T., Moldovan, S., Solomon, S.: Social anti-percolation, resistance and negative word-of-mouth. In: Sanchez, S., Lavigne, S. (eds.) Modeling an Artificial Stock Market: When Information Influence Market Dynamics, Handbook of Research on Nature Inspired Computing for Economics and Management. Idea Group (2006). http://www.idea-group.com/
Feige, U.: A tight lower bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(4), 433–438 (1995). doi:10.1002/rsa.3240060406
Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(1), 51–54 (1995). doi:10.1002/rsa.3240060106
Grimmett, G.: Percolation, 2nd edn. A Series of Comprehensive Studies in Mathematics, vol. 321. Springer (1999)
Gumel, A., Lenhart, S.: Modeling Paradigms and Analysis of Disease Transmission Models. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society (2010). https://books.google.pt/books?id=oeQ-BAAAQBAJ
Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P., Unger, W.: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series). Springer New York, Inc., Secaucus, NJ, USA (2005)
Jarrow, R., Protter, P.: Discrete versus continuous time models: local martingales and singular processes in asset pricing theory. Financ. Res. Lett. 9(2), 58–62 (2012). doi:10.1016/j.frl.2012.03.002. http://www.sciencedirect.com/science/article/pii/S1544612312000177
Kim, Y., Perrig, A., Tsudik, G.: Simple and fault-tolerant key agreement for dynamic collaborative groups. In: Proceedings of the 7th ACM Conference on Computer and Communications Security, CCS ’00, pp. 235–244. ACM, New York, NY, USA (2000). doi:10.1145/352600.352638
Kirchsteiger, C.: On the use of probabilistic and deterministic methods in risk analysis. J. Loss Prev. Process Ind. 12(5), 399–419 (1999)
Lebensztayn, É.: Um limitante superior para a probabilidade crtica do modelo dos sapos em rvores homogneas. Ph.D. thesis, Universidade de So Paulo (USP). Instituto de Matemtica e Estatstica, Brazil (2015). http://www.teses.usp.br/teses/disponiveis/45/45133/tde-24052013-125727/publico/Principal.pdf
Panagiotou, K., Pourmiri, A., Sauerwald, T.: Faster rumor spreading with multiple calls. Electr. J. Comb. 22(1), P1.23 (2015). http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p23
Penrose, M.: Random Geometric Graphs. University Press, New York, Oxford (2003)
Peres, Y., Sinclair, A., Sousi, P., Stauffer, A.: Mobile geometric graphs: detection, coverage and percolation. In: Randall, D. (ed.) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23–25, 2011, pp. 412–428. SIAM (2011). doi:10.1137/1.9781611973082.33
Pettarin, A., Pietracaprina, A., Pucci, G., Upfal, E.: Infectious random walks. CoRR abs/1007.1604 (2010). http://arxiv.org/abs/1007.1604
Pettarin, A., Pietracaprina, A., Pucci, G., Upfal, E.: Tight bounds on information dissemination in sparse mobile networks. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC ’11, pp. 355–362. ACM, New York, NY, USA (2011). doi:10.1145/1993806.1993882
Popov, S.Y.: Frogs and some other interacting random walks models. In: Banderier, C., Krattenthaler, C. (eds.) DMTCS Proceedings, Discrete Random Walks, DRW’03, vol. AC, pp. 277–288. Discrete Mathematics and Theoretical Computer Science (2003). http://www.dmtcs.org/proceedings/html/dmAC0126.abs.html
Resnick, M.: Decentralized modeling and decentralized thinking. In: Modeling and Simulation in Precollege Science and Mathematics, pp. 114–137 (1999)
Rothlauf, F.: Design of Modern Heuristics: Principles and Application, 1st edn. Springer Publishing Company, Incorporated (2011)
Acknowledgments
This work was developed within the FCT Project UID/MAT/00297/2013 of CMA and of Departamento de Matematica da Faculdade de Cincias e Tecnologia da Universidade Nova de Lisboa.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Dediu, AH., M. Matos, J., Martín-Vide, C. (2017). Theory and Practice of Discrete Interacting Agents Models. In: Adamatzky, A. (eds) Emergent Computation . Emergence, Complexity and Computation, vol 24. Springer, Cham. https://doi.org/10.1007/978-3-319-46376-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-46376-6_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46375-9
Online ISBN: 978-3-319-46376-6
eBook Packages: EngineeringEngineering (R0)