
Aledo, J. A., Goles, E., MontalvaMedel, M., Montealegre, P., & Valverde, J. C. (2023). Symmetrizable Boolean networks. Inf. Sci., 626, 787–804.
Abstract: In this work, we provide a procedure that allows us to transform certain kinds of deterministic Boolean networks on minterm or maxterm functions into symmetric ones, so inferring that such symmetrizable networks can present only periodic points of periods 1 or 2. In particular, we deal with generalized parallel (or synchronous) dynamical systems (GPDS) over undirected graphs, i. e., discrete parallel dynamical systems over undirected graphs where some of the selfloops may not appear. We also study the class of antisymmetric GPDS (which are nonsymmetrizable), proving that their periodic orbits have period 4. In addition, we introduce a class of nonsymmetrizable systems which admit periodic orbits with arbitrary large periods.



Becker, F., Montealegre, P., Rapaport, I., & Todinca, I. (2020). The Impact Of Locality In The Broadcast Congested Clique Model. SIAM Discret. Math., 34(1), 682–700.
Abstract: The broadcast congested clique model (BCLIQUE) is a messagepassing model of distributed computation where n nodes communicate with each other in synchronous rounds. First, in this paper we prove that there is a oneround, deterministic algorithm that reconstructs the input graph G if the graph is ddegenerate, and rejects otherwise, using bandwidth b = O(d . log n). Then, we introduce a new parameter to the model. We study the situation where the nodes, initially, instead of knowing their immediate neighbors, know their neighborhood up to a fixed radius r. In this new framework, denoted BCLIQuE[r], we study the problem of detecting, in G, an induced cycle of length at most k (CYCLE <= k) and the problem of detecting an induced cycle of length at least k +1 (CYCLE>k). We give upper and lower bounds. We show that if each node is allowed to see up to distance r = left perpendicular k/2 right perpendicular + 1, then a polylogarithmic bandwidth is sufficient for solving CYCLE>k with only two rounds. Nevertheless, if nodes were allowed to see up to distance r = left perpendicular k/3 right perpendicular, then any oneround algorithm that solves CYCLE>k needs the bandwidth b to be at least Omega(n/ log n). We also show the existence of a oneround, deterministic BCLIQUE algorithm that solves CYCLE <= k with bandwitdh b = O(n(1/left perpendicular k/2 right perpendicular). log n). On the negative side, we prove that, if epsilon <= 1/3 and 0 < r <= k/4, then any epsilonerror, Rround, bbandwidth algorithm in the BCLIQUE[r] model that solves problem CYCLE(<= k )satisfies R . b = Omega(n(1/left perpendicular k/2 right perpendicular)).



Goles, E., & Ruz, G. A. (2015). Dynamics of neural networks over undirected graphs. Neural Netw., 63, 156–169.
Abstract: In this paper we study the dynamical behavior of neural networks such that their interconnections are the incidence matrix of an undirected finite graph G = (V, E) (i.e., the weights belong to {0, 1}). The network may be updated synchronously (every node is updated at the same time), sequentially (nodes are updated one by one in a prescribed order) or in a blocksequential way (a mixture of the previous schemes). We characterize completely the attractors (fixed points or cycles). More precisely, we establish the convergence to fixed points related to a parameter alpha(G), taking into account the number of loops, edges, vertices as well as the minimum number of edges to remove from E in order to obtain a maximum bipartite graph. Roughly, alpha(G') < 0 for any G' subgraph of G implies the convergence to fixed points. Otherwise, cycles appear. Actually, for very simple networks (majority functions updated in a blocksequential scheme such that each block is of minimum cardinality two) we exhibit cycles with nonpolynomial periods. (C) 2014 Elsevier Ltd. All rights reserved.



Goles, E., MontalvaMedel, M., Montealegre, P., & RiosWilson, M. (2022). On the complexity of generalized Q2R automaton. Adv. Appl. Math., 138, 102355.
Abstract: We study the dynamic and complexity of the generalized Q2R automaton. We show the existence of nonpolynomial cycles as well as its capability to simulate with the synchronous update the classical version of the automaton updated under a block sequential update scheme. Furthermore, we show that the decision problem consisting in determine if a given node in the network changes its state is PHard.



Goles, E., Montealegre, P., & Vera, J. (2016). Naming Game Automata Networks. J. Cell. Autom., 11(56), 497–521.
Abstract: In this paper we introduce automata networks to model some features of the emergence of a vocabulary related with the naming game model. We study the dynamical behaviour (attractors and convergence) of extremal and majority local functions.



Goles, E., Slapnicar, I., & Lardies, M. A. (2021). Universal Evolutionary Model for Periodical Species. Complexity, 2021, 2976351.
Abstract: Realworld examples of periodical species range from cicadas, whose life cycles are large prime numbers, like 13 or 17, to bamboos, whose periods are large multiples of small primes, like 40 or even 120. The periodicity is caused by interaction of species, be it a predatorprey relationship, symbiosis, commensalism, or competition exclusion principle. We propose a simple mathematical model, which explains and models all those principles, including listed extremal cases. This rather universal, qualitative model is based on the concept of a local fitness function, where a randomly chosen new period is selected if the value of the global fitness function of the species increases. Arithmetically speaking, the different interactions are related to only four principles: given a couple of integer periods either (1) their greatest common divisor is one, (2) one of the periods is prime, (3) both periods are equal, or (4) one period is an integer multiple of the other.



VeraDamian, Y., Vidal, C., & GonzalezOlivares, E. (2019). Dynamics and bifurcations of a modified LeslieGowertype model considering a BeddingtonDeAngelis functional response. Math. Meth. Appl. Sci., 42(9), 3179–3210.
Abstract: In this paper, a planar system of ordinary differential equations is considered, which is a modified LeslieGower model, considering a BeddingtonDeAngelis functional response. It generates a complex dynamics of the predatorprey interactions according to the associated parameters. From the system obtained, we characterize all the equilibria and its local behavior, and the existence of a trapping set is proved. We describe different types of bifurcations (such as Hopf, BogdanovTakens, and homoclinic bifurcation), and the existence of limit cycles is shown. Analytic proofs are provided for all results. Ecological implications and a set of numerical simulations supporting the mathematical results are also presented.

