Abstract. A coupled cell system is a network of dynamical systems, or "cells," coupled together. Such systems can be represented schematically by a directed graph whose nodes correspond to cells and whose edges represent couplings. A symmetry of a coupled cell system is a permutation of the cells that preserves all internal dynamics and all couplings. Symmetry can lead to patterns of synchronized cells, rotating waves, multirhythms, and synchronized chaos. We ask whether symmetry is the only mechanism that can create such states in a coupled cell system and show that it is not. The key idea is to replace the symmetry group by the symmetry groupoid, which encodes information about the input sets of cells. (The input set of a cell consists of that cell and all cells connected to that cell.) The admissible vector fields for a given graph-the dynamical systems with the corresponding internal dynamics and couplings-are precisely those that are equivariant under the symmetry groupoid. A pattern of synchrony is "robust" if it arises for all admissible vector fields. The first main result shows that robust patterns of synchrony (invariance of "polydiagonal" subspaces under all admissible vector fields) are equivalent to the combinatorial condition that an equivalence relation on cells is "balanced." The second main result shows that admissible vector fields restricted to polydiagonal subspaces are themselves admissible vector fields for a new coupled cell network, the "quotient network." The existence of quotient networks has surprising implications for synchronous dynamics in coupled cell systems.

Link to this article: http://journals.cambridge.org/abstract_S0143385702000548How to cite this article: MARCUS PIVATO and REEM YASSAWI (2002). Limit measures for afne cellular automata.Abstract. Let M be a monoid (e.g. N, Z, or M D ), and A an abelian group. A M is then a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F : A M −→ A M that commutes with all shift maps. Let µ be a (possibly non-stationary) probability measure on A M ; we develop sufficient conditions on µ and F so that the sequence {F N µ} ∞ N=1 weak* converges to the Haar measure on A M in density (and thus, in Cesàro average as well). As an application, we show that, if A = Z /p (p prime), F is any 'non-trivial' LCA on A (Z D ) , and µ belongs to a broad class of measures (including most Bernoulli measures (for D ≥ 1) and 'fully supported' N-step Markov measures (when D = 1)), then F N µ weak* converges to the Haar measure in density.Card S(m j ) + log p (J ) + 2. stands for 'gap', and is the size of the gaps we will require.

A coupled cell system is a network of dynamical systems, or 'cells', coupled together. Such systems can be represented schematically by a directed graph whose nodes correspond to cells and whose edges represent couplings. A symmetry of a coupled cell system is a permutation of the cells and edges that preserves all internal dynamics and all couplings. It is well known that symmetry can lead to patterns of synchronized cells, rotating waves, multirhythms, and synchronized chaos. Recently, the introduction of a less stringent form of symmetry, the 'symmetry groupoid', has shown that global group-theoretic symmetry is not the only mechanism that can create such states in a coupled cell system. The symmetry groupoid consists of structure-preserving bijections between certain subsets of the cell network, the input sets. Here, we introduce a concept intermediate between the groupoid symmetries and the global group symmetries of a network: 'interior symmetry'. This concept is closely related to the groupoid structure, but imposes stronger constraints of a group-theoretic nature. We develop the local bifurcation theory of coupled cell systems possessing interior symmetries, by analogy with symmetric bifurcation theory. The main results are analogues for 'synchrony-breaking' bifurcations of the Equivariant Branching Lemma for steady-state bifurcation, and the Equivariant Hopf Theorem for bifurcation to time-periodic states.

We introduce a ranking of multidimensional alternatives, including uncertain prospects as a particular case, when these objects can be given a matrix form. This ranking is separable in terms of rows and columns, and continuous and monotonic in the basic quantities. Owing to the theory of additive separability developed here, we derive very precise numerical representations over a large class of domains (i.e., typically not of the Cartesian product form). We apply these representations to (1) streams of commodity baskets through time, (2) uncertain social prospects, (3) uncertain individual prospects. Concerning (1), we propose a finite horizon variant of Koopmans's (1960) [25] axiomatization of infinite discounted utility sums. The main results concern (2). We push the classic comparison between the ex ante and ex post social welfare criteria one step further by avoiding any expected utility assumptions, and as a consequence obtain what appears to be the strongest existing form of Harsanyi's (1955) [21] Aggregation Theorem. Concerning (3), we derive a subjective probability for Anscombe and Aumann's (1963) [1] finite case by merely assuming that there are two epistemically independent sources of uncertainty.