Generalized Number Theoretic Spin Chain-Connections to Dynamical Systems and Expectation Values

We generalize the number theoretic spin chain, a one-dimensional statistical model based on the Farey fractions, by introducing a parameter . This allows us to write recursion relations in the length of the chain. These relations are closely related to the Lewis three-term equation, which is useful in the study of the Selberg ζ-function. We then make use of these relations and spin orientation transformations. We find a simple connection with the transfer operator of a model of intermittency in dynamical systems. In addition, we are able to calculate certain spin expectation values explicitly in terms of the free energy or correlation length. Some of these expectation values appear to be directly connected with the mechanism of the phase transition     

On multi-team games

In this paper, we generalize convex static multi-team games to both non-convex and dynamic games. Multi-team dynamic Cournot, Hawk–Dove and Prisoner's Dilemma games are investigated. Puu's incomplete information dynamical systems are modified and applied to Cournot game.     

Cascading failures and the emergence of cooperation in evolutionary-game based models of social and economical networks

We study catastrophic behaviors in large networked systems in the paradigm of evolutionary games by incorporating a realistic "death" or "bankruptcy" mechanism. We find that a cascading bankruptcy process can arise when defection strategies exist and individuals are vulnerable to deficit. Strikingly, we observe that, after the catastrophic cascading process terminates, cooperators are the sole survivors, regardless of the game types and of the connection patterns among individuals as determined by the topology of the underlying network. It is necessary that individuals cooperate with each other to survive the catastrophic failures. Cooperation thus becomes the optimal strategy and absolutely outperforms defection in the game evolution with respect to the "death" mechanism. Our results can be useful for understanding large-scale catastrophe in real-world systems and in particular, they may yield insights into significant social and economical phenomena such as large-scale failures of financial institutions and corporations during an economic recession.     

An introduction to on-shell recursion relations

This article provides an introduction to on-shell recursion relations for calculations of tree-level amplitudes. Starting with the basics, such as spinor notations and color decompositions, we expose analytic properties of gauge-boson amplitudes, BCFW-deformations, the large z-behavior of amplitudes, and on-shell recursion relations of gluons. We discuss further developments of on-shell recursion relations, including generalization to other quantum field theories, supersymmetric theories in particular, recursion relations for off-shell currents, recursion relation with nonzero boundary contributions, bonus relations, relations for rational parts of one-loop amplitudes, recursion relations in 3D and a proof of CSW rules. Finally, we present samples of applications, including solutions of split helicity amplitudes and of N = 4 SYM theories, consequences of consistent conditions under recursion relation, Kleiss-Kuijf (KK) and Bern-Carrasco-Johansson (BCJ) relations for color-ordered gluon tree amplitudes, Kawai-Lewellen-Tye (KLT) relations.     

The coevolution of partner switching and strategy updating in non-excludable public goods game

Spatial public goods game is a popular metaphor to model the dilemma of collective cooperation on graphs, yet the non-excludable property of public goods has seldom been considered in previous models. Based upon a coevolutionary model where agents play public goods games and adjust their partnerships, the present model incorporates the non-excludable property of public goods: agents are able to adjust their participation in the games hosted by others, whereas they cannot exclude others from their own games. In the coevolution, a directed and dynamical network which represents partnerships among autonomous agents is evolved. We find that non-excludable property counteracts the positive effect of partner switching, i.e., the equilibrium level of cooperation is lower than that in the situation of excludable public goods game. Therefore, we study the effect of individual punishment that cooperative agents pay a personal cost to decrease benefits of those defective neighbors who participate in their hosted games. It is found that the cooperation level in the whole population is heightened in the presence of such a costly behavior.     

On Quantum Team Games

Recently Liu and Simaan (2004) convex static multi-team classical games have been introduced. Here they are generalized to both nonconvex, dynamic and quantum games. Puu's incomplete information dynamical systems are modified and applied to Cournot team game. The replicator dynamics of the quantum prisoner's dilemma game is also studied.     

Randomly chosen chaotic maps can give rise to nearly ordered behavior

Parrondo’s paradox [J.M.R. Parrondo, G.P. Harmer, D. Abbott, New paradoxical games based on Brownian ratchets, Phys. Rev. Lett. 85 (2000), 5226–5229] (see also [O.E. Percus, J.K. Percus, Can two wrongs make a right? Coin-tossing games and Parrondo’s paradox, Math. Intelligencer 24 (3) (2002) 68–72]) states that two losing gambling games when combined one after the other (either deterministically or randomly) can result in a winning game: that is, a losing game followed by a losing game = a winning game. Inspired by this paradox, a recent study [J. Almeida, D. Peralta-Salas, M. Romera, Can two chaotic systems give rise to order? Physica D 200 (2005) 124–132] asked an analogous question in discrete time dynamical system: can two chaotic systems give rise to order, namely can they be combined into another dynamical system which does not behave chaotically? Numerical evidence is provided in [J. Almeida, D. Peralta-Salas, M. Romera, Can two chaotic systems give rise to order? Physica D 200 (2005) 124–132] that two chaotic quadratic maps, when composed with each other, create a new dynamical system which has a stable period orbit. The question of what happens in the case of random composition of maps is posed in [J. Almeida, D. Peralta-Salas, M. Romera, Can two chaotic systems give rise to order? Physica D 200 (2005) 124–132] but left unanswered. In this note we present an example of a dynamical system where, at each iteration, a map is chosen in a probabilistic manner from a collection of chaotic maps. The resulting random map is proved to have an infinite absolutely continuous invariant measure (acim) with spikes at two points. From this we show that the dynamics behaves in a nearly ordered manner. When the foregoing maps are applied one after the other, deterministically as in [O.E. Percus, J.K. Percus, Can two wrongs make a right? Coin-tossing games and Parrondo’s paradox, Math. Intelligencer 24 (3) (2002) 68–72], the resulting composed map has a periodic orbit which is stable.     

Constructing quantum games from symmetric non-factorizable joint probabilities

We construct quantum games from a table of non-factorizable joint probabilities, coupled with a symmetry constraint, requiring symmetrical payoffs between the players. We give the general result for a Nash equilibrium and payoff relations for a game based on non-factorizable joint probabilities, which embeds the classical game. We study a quantum version of Prisoners' Dilemma, Stag Hunt, and the Chicken game constructed from a given table of non-factorizable joint probabilities to find new outcomes in these games. We show that this approach provides a general framework for both classical and quantum games without recourse to the formalism of quantum mechanics.     

Parrondo Games as Lattice Gas Automata

Parrondo games are coin flipping games with the surprising property that alternating plays of two losing games can produce a winning game. We show that this phenomenon can be modelled by probabilistic lattice gas automata. Furthermore, motivated by the recent introduction of quantum coin flipping games, we show that quantum lattice gas automata provide an interesting definition for quantum Parrondo games.     

Dynamics of multi-frequency minority games

The dynamics of minority games with agents trading on different time scales is studied via dynamical mean-field theory. We analyze the case where the agents decision-making process is deterministic and its stochastic generalization with finite heterogeneous learning rates. In each case, we characterize the macroscopic properties of the steady states resulting from different frequency and learning rate distributions and calculate the corresponding phase diagrams. Finally, the different roles played by regular and occasional traders, as well as their impact on the systems global efficiency, are discussed.Received: 4 August 2003, Published online: 22 September 2003PACS: 87.23.Ge Dynamics of social systems - 05.65.+b Self-organized systems - 02.50.Le Decision theory and game theory - 05.10.Gg Stochastic analysis methods     

Move ordering and communities in complex networks describing the game of go

We analyze the game of go from the point of view of complex networks. We construct three different directed networks of increasing complexity, defining nodes as local patterns on plaquettes of increasing sizes, and links as actual successions of these patterns in databases of real games. We discuss the peculiarities of these networks compared to other types of networks. We explore the ranking vectors and community structure of the networks and show that this approach enables to extract groups of moves with common strategic properties. We also investigate different networks built from games with players of different levels or from different phases of the game. We discuss how the study of the community structure of these networks may help to improve the computer simulations of the game. More generally, we believe such studies may help to improve the understanding of human decision process.     

Thermalization in nature and on a quantum computer

In this work, we show how Gibbs or thermal states appear dynamically in closed quantum many-body systems, building on the program of dynamical typicality. We introduce a novel perturbation theorem for physically relevant weak system-bath couplings that is applicable even in the thermodynamic limit. We identify conditions under which thermalization happens and discuss the underlying physics. Based on these results, we also present a fully general quantum algorithm for preparing Gibbs states on a quantum computer with a certified runtime and error bound. This complements quantum Metropolis algorithms, which are expected to be efficient but have no known runtime estimates and only work for local Hamiltonians.     

Basins of coexistence and extinction in spatially extended ecosystems of cyclically competing species

Microscopic models based on evolutionary games on spatially extended scales have recently been developed to address the fundamental issue of species coexistence. In this pursuit almost all existing works focus on the relevant dynamical behaviors originated from a single but physically reasonable initial condition. To gain comprehensive and global insights into the dynamics of coexistence, here we explore the basins of coexistence and extinction and investigate how they evolve as a basic parameter of the system is varied. Our model is cyclic competitions among three species as described by the classical rock-paper-scissors game, and we consider both discrete lattice and continuous space, incorporating species mobility and intraspecific competitions. Our results reveal that, for all cases considered, a basin of coexistence always emerges and persists in a substantial part of the parameter space, indicating that coexistence is a robust phenomenon. Factors such as intraspecific competition can, in fact, promote coexistence by facilitating the emergence of the coexistence basin. In addition, we find that the extinction basins can exhibit quite complex structures in terms of the convergence time toward the final state for different initial conditions. We have also developed models based on partial differential equations, which yield basin structures that are in good agreement with those from microscopic stochastic simulations. To understand the origin and emergence of the observed complicated basin structures is challenging at the present due to the extremely high dimensional nature of the underlying dynamical system.     

A concept of homeomorphic defect for defining mostly conjugate dynamical systems

A centerpiece of dynamical systems is comparison by an equivalence relationship called topological conjugacy. We present details of how a method to produce conjugacy functions based on a functional fixed point iteration scheme can be generalized to compare dynamical systems that are not conjugate. When applied to nonconjugate dynamical systems, we show that the fixed-point iteration scheme still has a limit point, which is a function we now call a "commuter"-a nonhomeomorphic change of coordinates translating between dissimilar systems. This translation is natural to the concepts of dynamical systems in that it matches the systems within the language of their orbit structures, meaning that orbits must be matched to orbits by some commuter function. We introduce methods to compare nonequivalent systems by quantifying how much the commuter function fails to be a homeomorphism, an approach that gives more respect to the dynamics than the traditional comparisons based on normed linear spaces, such as L(2). Our discussion addresses a fundamental issue-how does one make principled statements of the degree to which a "toy model" might be representative of a more complicated system?     

Enhanced convergence and robust performance of randomized dynamical decoupling

We demonstrate the advantages of randomization in coherent quantum dynamical control. For systems which are either time-varying or require decoupling cycles involving a large number of operations, we find that simple randomized protocols offer superior convergence and stability as compared to deterministic counterparts. In addition, we show how randomization may allow us to outperform purely deterministic schemes at long times, including combinatorial and concatenated methods. General criteria for optimally interpolating between deterministic and stochastic design are proposed and illustrated in explicit decoupling scenarios relevant to quantum information storage.     

Effective theories for circuits and automata

Abstracting an effective theory from a complicated process is central to the study of complexity. Even when the underlying mechanisms are understood, or at least measurable, the presence of dissipation and irreversibility in biological, computational, and social systems makes the problem harder. Here, we demonstrate the construction of effective theories in the presence of both irreversibility and noise, in a dynamical model with underlying feedback. We use the Krohn-Rhodes theorem to show how the composition of underlying mechanisms can lead to innovations in the emergent effective theory. We show how dissipation and irreversibility fundamentally limit the lifetimes of these emergent structures, even though, on short timescales, the group properties may be enriched compared to their noiseless counterparts.     

Fractality of deterministic diffusion in the nonhyperbolic climbing sine map

The nonlinear climbing sine map is a nonhyperbolic dynamical system exhibiting both normal and anomalous diffusion under variation of a control parameter. We show that on a suitable coarse scale this map generates an oscillating parameter-dependent diffusion coefficient, similarly to hyperbolic maps, whose asymptotic functional form can be understood in terms of simple random walk approximations. On finer scales we find fractal hierarchies of normal and anomalous diffusive regions as functions of the control parameter. By using a Green–Kubo formula for diffusion the origin of these different regions is systematically traced back to strong dynamical correlations. Starting from the equations of motion of the map these correlations are formulated in terms of fractal generalized Takagi functions obeying generalized de Rham-type functional recursion relations. We finally analyze the measure of the normal and anomalous diffusive regions in the parameter space showing that in both cases it is positive, and that for normal diffusion it increases by increasing the parameter value.     

A “No-Go” theorem for the existence of a discrete action principle

In this paper, we study the problem of the existence of a least-action principle for invertible, second-order dynamical systems, discrete in time and space. We show that, when the configuration space is finite and arbitrary state transitions are allowed, a least-action principle does not exist for such systems. We dichotomize discrete dynamical systems with infinite configuration spaces into those of finite type for which this theorem continues to hold, and those not of finite type for which it is possible to construct a least-action principle. We also show how to recover an action, by restriction of the phase space of certain second-order discrete dynamical systems. We provide numerous examples to illustrate each of these results.     

Three applications of a bonus relation for gravity amplitudes

Arkani-Hamed et al. have recently shown that all tree-level scattering amplitudes in maximal supergravity exhibit exceptionally soft behavior when two supermomenta are taken to infinity in a particular complex direction, and that this behavior implies new non-trivial relations amongst amplitudes in addition to the well-known on-shell recursion relations. We consider the application of these new ‘bonus relations’ to MHV amplitudes, showing that they can be used quite generally to relate (n−2)!$(n-2)!$-term formulas typically obtained from recursion relations to (n−3)!$(n-3)!$-term formulas related to the original BGK conjecture. Specifically we provide (1) a direct proof of a formula presented by Elvang and Freedman, (2) a new formula based on one due to Bedford et al., and (3) an alternate proof of a formula recently obtained by Mason and Skinner. Our results also provide the first direct proof that the conjectured BGK formula, only very recently proven via completely different methods, satisfies the on-shell recursion.