We address the problem of how the survival of cooperation in a social system depends on the motion of the individuals. Specifically, we study a model in which prisoner’s dilemma players are allowed to move in a two-dimensional plane. Our results show that cooperation can survive in such a system provided that both the temptation to defect and the velocity at which agents move are not too high. Moreover, we show that when these conditions are fulfilled, the only asymptotic state of the system is that in which all players are cooperators. Our results might have implications for the design of cooperative strategies in motion coordination and other applications including wireless networks.

Memristors are gaining increasing attention as next generation electronic devices. They are also becoming commonly used as fundamental blocks for building chaotic circuits, although often arbitrary (typically piece-wise linear or cubic) flux-charge characteristics are assumed. In this paper, a chaotic circuit based on the mathematical realistic model of the HP memristor is introduced. The circuit makes use of two HP memristors in antiparallel. Numerical results showing some of the chaotic attractors generated by this circuit and the behavior with respect to changes in its component values are described.

We study phase synchronization in a network motif with a starlike structure in which the central node's (the hub's) frequency is strongly detuned against the other peripheral nodes. We find numerically and experimentally a regime of remote synchronization (RS), where the peripheral nodes form a phase synchronized cluster, while the hub remains free with its own dynamics and serves just as a transmitter for the other nodes. We explain the mechanism for this RS by the existence of a free amplitude and also show that systems with a fixed or constant amplitude, such as the classic Kuramoto phase oscillator, are not able to generate this phenomenon. Further, we derive an analytic expression which supports our explanation of the mechanism.

We consider a set of mobile agents in a two dimensional space, each one of them carrying a chaotic oscillator, and discuss the related synchronization issues under the framework of time-variant networks. In particular, we show that, as far as the time scale for the motion of the agents is much shorter than that of the associated dynamical systems, the global behavior can be characterized by a scaled all-to-all Laplacian matrix, and the synchronization conditions depend on the agent density on the plane.

Chimera states, that is, dynamical regimes characterized by the existence of a symmetry-broken solution where a coherent domain and an incoherent one coexist, have been theoretically demonstrated and numerically found in networks of homogeneously coupled identical oscillators. In this work we experimentally investigate the behavior of a closed and an open chain of electronic circuits with neuron-like spiking dynamics and first neighbor connections. Experimental results show the onset of a regime that we call chimera states with quiescent and synchronous domains, where synchronization coexists with spatially patterned oscillation death. The whole experimental bifurcation scenario, showing how disordered states, synchronization, chimera states with quiescent and synchronous domains, and oscillatory death states emerge as coupling is varied, is presented.

Chimera states have been recently found in a variety of different coupling schemes and geometries. In most cases, the underlying coupling structure is considered to be static, while many realistic systems display significant temporal changes in the pattern of connectivity. In this work we investigate a time-varying network made of two coupled populations of Kuramoto oscillators, where the links between the two groups are considered to vary over time. As a main result we find that the network may support stable, breathing, and alternating chimera states. We also find that, when the rate of connectivity changes is fast, compared to the oscillator dynamics, the network may be described by a low-dimensional system of equations. Unlike in the static heterogeneous case, the onset of alternating chimera states is due to the presence of fluctuations, which may be induced either by the finite size of the network or by large switching times.