RAMON ALONSO SANZ - Profile on Academia.edu (original) (raw)

Papers by RAMON ALONSO SANZ

Complex dynamics of elementary cellular automata emerging from chaotic rules

Quantum Information Processing, 2020

The quantum war of attrition game is studied in this work via spatial numerical simulation. It is... more The quantum war of attrition game is studied in this work via spatial numerical simulation. It is found that the implemented simulation converges to the Pareto optimal solution, i.e. no fighting at all, when the resign times of the players are entangled with higher factor, whereas larger resign times would be got with weak entanglement. This finding is shown to apply also in a fiercer war game, the war of extermination, in which game the non-entangled (or classical) simulation leads to very high resign times and consequently to very high negative payoffs.

Self-Organization in the Battle of the Sexes

International Journal of Modern Physics C, 2011

This paper presents a spatial version of the iterated battle of the sexes game in which every one... more This paper presents a spatial version of the iterated battle of the sexes game in which every one individual plays with his nearest partners and imitates the optimal strategy of his nearest mate neighbors. It is concluded that the spatial structure enables the emergence of clusters of coincident choices, leading to the mean payoff per encounter to values that are accessible only in the cooperative two-person game scenario, which constitutes a notable case of self-organization.

Memory Boosts Cooperation

International Journal of Modern Physics C, 2006

The standard spatial formulation of the iterated Prisoner's Dilemma is ahistoric (memoryless)... more The standard spatial formulation of the iterated Prisoner's Dilemma is ahistoric (memoryless): i.e., only the results generated in the last round are taken into account in deciding the next choice. Historic memory can be implemented by featuring players by a summary of their previous winnigs and choices. Here we study the effect of limited trailing memory: only the last three iterations are recorded. The effects of full and discounted memory are assessed. It is concluded that this short-type memory stimulates cooperation.

Encyclopedia of Complexity and Systems Science, 2009

Extending the Parameter Interval in the Logistic Map with Memory

International Journal of Bifurcation and Chaos, 2011

When memory is endowed in the dynamics of the logistic map, its parameter may reach, without dive... more When memory is endowed in the dynamics of the logistic map, its parameter may reach, without diverging, values than are greater than its upper limit in the ahistoric, conventional formulation. A numerical study is made in this study on the dynamics of the logistic map with memory mT: xT+1= λmT(1-mT), when λ > 4.0 or λ < -2.0.

Complex Dynamics of Elementary Cellular Automata Emerging from Chaotic Rules

International Journal of Bifurcation and Chaos, 2012

We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behavior.... more We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behavior. CA are well-known computational substrates for studying emergent collective behavior, complexity, randomness and interaction between order and chaotic systems. A number of attempts have been made to classify CA functions on their space-time dynamics and to predict the behavior of any given function. Examples include mechanical computation, λ and Z-parameters, mean field theory, differential equations and number conserving features. We aim to classify CA based on their behavior when they act in a historical mode, i.e. as CA with memory. We demonstrate that cell-state transition rules enriched with memory quickly transform a chaotic system converging to a complex global behavior from almost any initial condition. Thus, just in few steps we can select chaotic rules without exhaustive computational experiments or recurring to additional parameters. We provide an analysis of well-known chaot...

Sección docente y problemas: Problemas tipo en teoría de la decisión

Reversible structurally dynamic cellular automata with memory: A simple example

Journal of Cellular Automata. Volume 2, Number 3, 2007. p. 179-201 Reversible Structurally Dynami... more Journal of Cellular Automata. Volume 2, Number 3, 2007. p. 179-201 Reversible Structurally Dynamic Cellular Automata with Memory: A Simple Example Ramón Alonso-Sanz abstract Full Text (IP) p. 203-217 Universal Simulations ...

International Journal of Bifurcation and Chaos, 2016

Actin is a globular protein which forms long polar filaments in eukaryotic. The actin filaments p... more Actin is a globular protein which forms long polar filaments in eukaryotic. The actin filaments play the roles of cytoskeleton, motility units, information processing and learning. We model actin filament as a double chain of finite state machines, nodes, which take states “0” and “1”. The states are abstractions of absence and presence of a subthreshold charge on actin units corresponding to the nodes. All nodes update their state in parallel to discrete time. A node updates its current state depending on states of two closest neighbors in the node chain and two closest neighbors in the complementary chain. Previous models of actin automata consider momentary state transitions of nodes. We enrich the actin automata model by assuming that states of nodes depend not only on the current states of neighboring node but also on their past states. Thus, we assess the effect of memory of past states on the dynamics of acting automata. We demonstrate in computational experiments that memory...

Simulation of the Hotelling–Smithies game: Hotelling was not so wrong

Communications in Nonlinear Science and Numerical Simulation

Qsdgca-Data

The zip file contains all the source date presented in the graphs of the article

Data from: A quantum Samaritan's dilemma cellular automaton

The dynamics of a spatial quantum formulation of the iterated Samaritan’s dilemma game with varia... more The dynamics of a spatial quantum formulation of the iterated Samaritan’s dilemma game with variable entangling is studied in this work. The game is played in the cellular automata manner, i.e. with local and synchronous interaction. The game is assessed in fair and unfair contests, in noiseless scenarios and with disrupting quantum noise

Phase Transition in Elementary Cellular Automata with Memory

International Journal of Bifurcation and Chaos, 2014

We study elementary cellular automata with memory. The memory is a weighted function averaged ove... more We study elementary cellular automata with memory. The memory is a weighted function averaged over cell states in a time interval, with a varying factor which determines how strongly a cell's previous states contribute to the cell's present state. We classify selected cell-state transition functions based on Lempel–Ziv compressibility of space-time automaton configurations generated by these functions and the spectral analysis of their transitory behavior. We focus on rules 18, 22, and 54 because they exhibit the most intriguing behavior, including computational universality. We show that a complex behavior is observed near the nonmonotonous transition to null behavior (rules 18 and 54) or during the monotonic transition from chaotic to periodic behavior (rule 22).

Dynamic Games and Applications, 2012

The dynamics of a spatial, continuous-valued formulation of the iterated battle of the sexes is a... more The dynamics of a spatial, continuous-valued formulation of the iterated battle of the sexes is assessed in this work. The game is played in the cellular automaton manner, i.e., with local and synchronous interaction. The effects of probabilistic updating and memory of past encounters are also taken into account. With deterministic updating, the spatial structure enables the emergence of coordination clusters, leading to the mean payoffs per encounter to values that are accessible only in the cooperative two-person game scenario, which constitutes a notable case of self-organization. With probabilistic updating of choices, both kinds of player tend to reach a full coordination absorbing steady state in the long term. As a general rule, short-term memory of past iterations does not qualitatively alter the ahistoric dynamics. Unlimited trailing memory induces an inertial effect that alters the dynamics to a larger extent, particularly in the probabilistic updating scenario, in which case unlimited trailing memory fully inhibits the dynamics.

Elementary Probabilistic Cellular Automata with Memory in Cells

Lecture Notes in Computer Science, 2004

Page 1. Elementary Probabilistic Cellular Automata with Memory in Cells Ramón Alonso-Sanz1 and Ma... more Page 1. Elementary Probabilistic Cellular Automata with Memory in Cells Ramón Alonso-Sanz1 and Margarita Martın2 1 ETSI Agrónomos (Estadıstica), C.Universitaria. 28040, Madrid, Spain. ralonso@est.etsia.upm.es 2 Bioquımica y Biologıa Molecular IV, UCM. C.Universitaria. ...

Effect of Memory on Boolean Networks with Disordered Dynamics: The K = 4 Case

International Journal of Modern Physics C, 2007

In standard Cellular Automata (CA) and Boolean Networks (BN), the new state of a cell depends on ... more In standard Cellular Automata (CA) and Boolean Networks (BN), the new state of a cell depends on the neighborhood configuration only at the preceding time step. The effect of implementing memory in cells on CA, CA on networks and BN with different degrees of random rewiring is studied in this paper paying attention to the particular case of four inputs. As a rule, memory in cells induces a moderation in the rate of changing cells and in the damage spreading, albeit in the latter case memory turns out ineffective in the control of the damage as the wiring network moves away of the ordered structure that features proper CA.

Journal of Computational Science, 2011

A β-skeleton is a proximity undirected graph whose connectivity is determined by the parameter β.... more A β-skeleton is a proximity undirected graph whose connectivity is determined by the parameter β. We study β-skeleton automata where every node is a finite state machine taking two states, and updating its states depending on the states of adjacent automata-nodes. We allow automata-nodes to remember their previous states. In computational experiments we study how memory affects the global space-time dynamics on β-skeleton automata.

Reversible cellular automata with memory of delay type

Complexity, 2014

The effect of delay type memory of past states on reversible elementary cellular automata (CA) is... more The effect of delay type memory of past states on reversible elementary cellular automata (CA) is examined in this study. It is assessed in simple scenarios, such as elementary CA, but the feasibility of enriching the dynamics with memory in a general reversible CA context is also outlined. © 2014 Wiley Periodicals, Inc. Complexity 20: 49–56, 2014