Abstract
Eric Goles, son of a theatre actress and a musician, was born in Antofagasta, in northern Chile, between the Pacific Ocean and the desert of Atacama. In 1970, he joined the University of Chile and graduated with a degree in mathematical engineering in 1975.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aracena J, Demongeot J, Goles E (2004) Positive and negative circuits in discrete neural networks. IEEE Trans Neural Netw 15(1):77–83
Bak P, Tang C, Wiesenfeld K (1987) Self-organized criticality: an explanation of the 1/f noise. Phys Rev Lett 59(4):381
Bitar J, Goles E (1992) Parallel chip firing games on graphs. Theor Comput Sci 92(2):291–300
Bitar N, Goles E, Montealegre P (2019) Computational complexity of restricted diffusion limited aggregation. arXiv:1904.10011
Lucas B, Pedro M, Eric G, Hans G (2020) Competing activists-political polarization. Physica A: Stat Mech Appl 545:123713
Böttcher L, Woolley-Meza O, Goles E, Helbing D, Herrmann HJ (2016) Connectivity disruption sparks explosive epidemic spreading. Phys Rev E 93(4):042315
Canals C, Goles E, Mascareño A, Rica S, Ruz GA (2018) School choice in a market environment: individual versus social expectations. Complexity
Goles EC (1985) Dynamics of positive automata networks. Theor Comput Sci 41:19–32
Goles EC, Matamala M (1994) Dynamical and complexity results for high order neural networks. Int J Neural Syst 5(3):241–252
Goles EC, Matamala M (1996) Symmetric discrete universal neural networks. Theor Comput Sci 168(2):405–416
Goles EC, Ruz GA (2015) Dynamics of neural networks over undirected graphs. Neural Netw 63:156–169
Goles EC (1980) Comportement oscillatoire d’une famille d’automates cellulaires non uniformes. PhD thesis, Grenoble Institute of Technology, France
Cosnard M, Goles EC (1995) A characterization of the existence of energies for neural networks. In: Fülöp Z, Gécseg F (eds) Proceedings of the automata, languages and programming, 22nd international colloquium, ICALP95, Szeged, Hungary, 10–14 July 1995. Lecture notes in computer science, vol 944. Springer, pp 570–580
Michel Cosnard and Eric Goles Ch (1997) Discrete state neural networks and energies. Neural Netw 10(2):327–334
Cosnard M, Moumida D, Goles E, de St Pierre T (1988) Dynamical behavior of a neural automaton with memory. Compl Syst 2(2):161–176
Delahaye JP (2018) Faut-il adopter l’avis de ces voisins. Pour la Sci 494
Domic NG, Goles E, Rica S (2011) Dynamics and complexity of the schelling segregation model. Phys Rev E 83(5):056111
Dürr C, Goles E, Rapaport I, Rémila E (2003) Tiling with bars under tomographic constraints. Theor Comput Sci 290(3):1317–1329
Fogelman-Soulie F, Goles-Chacc E, Weisbuch G (1982) Specific roles of the different boolean mappings in random networks. Bull Math Biol 44(5):715–730
Fogelman-Soulié F, MejÃa C, Goles E, Aguilera SM (1989) Energy functions in neural networks with continuous local functions. Compl Syst 3(3)
Formenti E, Goles E, Martin B (2012) Computational complexity of avalanches in the kadanoff sandpile model. Fundamenta Informaticae 115(1):107–124
Gajardo A, Goles E (2001) Universal cellular automaton over a hexagonal tiling with 3 states. Int J Algebr Comput 11(03):335–354
Gajardo A, Goles E (2006) Crossing information in two-dimensional sandpiles. Theor Comput Sci 369(1–3):463–469
Gajardo A, Goles E (2004) Dynamics of a class of ants on a one-dimensional lattice. Theor Comput Sci 322(2):267–283
Gajardo A, Goles E, Moreira A (2001) Generalized langton’s ant: dynamical behavior and complexity. In: Annual symposium on theoretical aspects of computer science. Springer, pp 259–270
Gajardo A, Moreira A, Goles E (2002) Complexity of langton’s ant. Disc Appl Math 117(1–3):41–50
Goles E, Matamala M (1997) Reaction-diffusion automata: three states implies universality. Theory Comput Syst 30(3):223–229
Goles E, Moreira A, Rapaport I (2011) Communication complexity in number-conserving and monotone cellular automata. Theor Comput Sci 412(29):3616–3628
Goles E, Vichniac G (1990) Energy and attractors in parallel potts dynamics. J Phys A: Math Gen 23(7):1329
Goles E (1982) Fixed point behavior of threshold functions on a finite set. SIAM J Algebr Disc Methods 3(4):529–531
Goles E (1985) Comportement dynamique de reseaux d’automates. PhD thesis, Université de Grenoble, France
Goles E (1986) Antisymmetrical neural networks. Disc Appl Math 13(1):97–100
Goles E (1992) Sand pile automata. Ann de l’IHP Physique théorique 56:75–90
Goles E (2004) Folding and tiling. Theor Comput Sci 322(2):285–296
Goles E, Gómez L (2018) Combinatorial game associated to the one dimensional schelling’s model of social segregation. Nat Comput 17(2):427–436
Goles E, Kiwi MA (1992) Dynamics of sand-piles games on graphs. In: Latin American symposium on theoretical informatics. Springer, pp 219–230
Goles E, Kiwi MA (1993) Games on line graphs and sand piles. Theor Comput Sci 115(2):321–349
Goles E, Latapy M, Magnien C, Morvan M, Phan HD (2004) Sandpile models and lattices: a comprehensive survey. Theoret Comput Sci 322(2):383–407
Goles E, Little C, Rapaport I (2008) Understanding a non-trivial cellular automaton by finding its simplest underlying communication protocol. In: International symposium on algorithms and computation. Springer, pp 592–604
Goles E, Lobos F, Ruz GA, Sené S (2020) Attractor landscapes in boolean networks with firing memory: a theoretical study applied to genetic networks. Nat Comput 19(2):295–319
Goles E, Maass A, Martinez S (1993) On the limit set of some universal cellular automata. Theor Comput Sci 110(1):53–78
Goles E, Margenstern M (1996) Sand pile as a universal computer. Int J Mod Phys C 7(02):113–122
Goles E, Margenstern M (1997) Universality of the chip-firing game. Theor Comput Sci 172(1–2):121–134
Goles E, Martinez S (1989) Exponential transient classes of symmetric neural networks for synchronous and sequential updating. Complex Syst 3(6):589–597
Goles E, Martţnez S (1991) Lyapunov functionals for automata networks defined by cyclically monotone functions. SIAM J Disc Math 4(2):200–206
Goles E, Meunier P-E, Rapaport I, Theyssier G (2009) Communications in cellular automata. In: Neary T, Woods D, Seda T, Murphy N (eds) Proceedings international workshop on the complexity of simple programs, Cork, Ireland, 6–7th Dec 2008, volume 1 of electronic proceedings in theoretical computer science. Open Publishing Association, pp 81–92
Goles E, Montalva M, Ruz GA (2013) Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks. Bull Math Biol 75(6):939–966
Goles E, Montealegre P (2014) Computational complexity of threshold automata networks under different updating schemes. Theor Comput Sci 559:3–19
Goles E, Montealegre P (2015) The complexity of the majority rule on planar graphs. Adv Appl Math 64:111–123
Goles E, Montealegre P, Perrot K, Theyssier G (2018) On the complexity of two-dimensional signed majority cellular automata. J Comput Syst Sci 91:1–32
Goles E, Montealegre P, RÃos-Wilson M, Theyssier G (2020) On the impact of treewidth in the computational complexity of freezing dynamics. arXiv:2005.11758
Goles E, Montealegre P, Salo V, Törmä I (2016) Pspace-completeness of majority automata networks. Theor Comput Sci 609:118–128
Goles E, Montealegre-Barba P, Todinca I (2013) The complexity of the bootstraping percolation and other problems. Theor Comput Sci 504:73–82
Goles E, Moreira A (2012) Number-conserving cellular automata and communication complexity: a numerical exploration beyond elementary CAS. J Cell Automata 7(3)
Goles E, Morvan M, Phan HD (2002) Lattice structure and convergence of a game of cards. Ann Comb 6(3–4):327–335
Goles E, Morvan M, Phan HD (2002) Sandpiles and order structure of integer partitions. Disc Appl Math 117(1-3):51–64
Goles E, Olivos J (1980) Periodic behaviour of generalized threshold functions. Disc Math 30(2):187–189
Goles E, Olivos J (1981) Comportement périodique des fonctions à seuil binaires et applications. Disc Appl Math 3(2):93–105
Goles E, Prisner E (2000) Source reversal and chip firing on graphs. Theor Comput Sci 233(1–2):287–295
Goles E, Rapaport I (1999) Tiling allowing rotations only. Theor Comput Sci 218(2):285–295
Goles E, Tchuenté M (1983) Iterative behaviour of generalized majority functions. Math Soc Sci 4(3):197–204
Goles-Chacc E, Fogelman-Soulié F, Pellegrin D (1985) Decreasing energy functions as a tool for studying threshold networks. Disc Appl Math 12(3):261–277
Hegselmann R, Schelling TC, Sakoda JM (2017) The intellectual, technical, and social history of a model. J Artif Soc Soc Simul 20(3)
Kauffman SA (1969) Metabolic stability and epigenesis in randomly constructed genetic nets. J Theor Biol 22(3):437–467
Kiwi MA, Ndoundam R, Tchuente M, Goles E (1994) No polynomial bound for the period of the parallel chip firing game on graphs. Theor Comput Sci 136(2):527–532
Langton CG (1986) Studying artificial life with cellular automata. Physica D: Nonlinear Phenom 22(1-3):120–149
Markus M, Schmick M, Goles E (2006) Tracks emerging by forcing langton’s ant with binary sequences. Complexity 11(3):27–32
Mascareño A, Goles E, Ruz GA (2016) Crisis in complex social systems: a social theory view illustrated with the chilean case. Complexity 21(S2):13–23
Medina P, Goles E, Zarama R, Rica S (2017) Self-organized societies: on the sakoda model of social interactions. Complexity
Ruz GA, Goles E, Sené S (2018) Reconstruction of boolean regulatory models of flower development exploiting an evolution strategy. In: 2018 IEEE congress on evolutionary computation (CEC). IEEE, pp 1–8
Ruz GA, Timmermann T, Goles E (2016) Neutral space analysis of gene regulatory network models of salt stress response in arabidopsis using evolutionary computation. In: 2016 IEEE congress on evolutionary computation (CEC). IEEE, pp 4281–4288
Ruz GA, Zúñiga A, Goles E (2018) A boolean network model of bacterial quorum-sensing systems. Int J Data Mining Bioinf 21(2):123–144
Sakoda JM (1971) The checkerboard model of social interaction. J Math Sociol 1(1):119–132
Schelling TC (1971) Dynamic models of segregation. J Math Sociol 1(2):143–186 (1971)
Spencer J (1986) Balancing vectors in the max norm. Combinatorica 6(1):55–65
Travisany D, Goles E, Latorre M, Cortés M-P, Maass A (2020) Generation and robustness of boolean networks to model clostridium difficile infection. Nat Comput 19(1):111–134
Vera J, Goles E (2016) Automata networks for memory loss effects in the formation of linguistic conventions. Cogn Comput 8(3):462–466
Vieira AP, Goles E, Herrmann HJ (2020) Dynamics of extended schelling models. J Stat Mech: Theory Exp 2020(1):013212
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Adamatzky, A. (2022). Eric Goles. In: Adamatzky, A. (eds) Automata and Complexity. Emergence, Complexity and Computation, vol 42. Springer, Cham. https://doi.org/10.1007/978-3-030-92551-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-92551-2_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92550-5
Online ISBN: 978-3-030-92551-2
eBook Packages: EngineeringEngineering (R0)