Reconstructing the structure of directed and weighted networks of nonlinear oscillators

Human Crowds as Social Networks: Collective Dynamics of Consensus and Polarization

A ubiquitous type of collective behavior and decision-making is the coordinated motion of bird flocks, fish schools, and human crowds. Collective decisions to move in the same direction, turn right or left, or split into subgroups arise in a self-organized fashion from local interactions between individuals without central plans or designated leaders. Strikingly similar phenomena of consensus (collective motion), clustering (subgroup formation), and bipolarization (splitting into extreme groups) are also observed in opinion formation. As we developed models of crowd dynamics and analyzed crowd networks, we found ourselves going down the same path as models of opinion dynamics in social networks. In this article, we draw out the parallels between human crowds and social networks. We show that models of crowd dynamics and opinion dynamics have a similar mathematical form and generate analogous phenomena in multiagent simulations. We suggest that they can be unified by a common collective dynamics, which may be extended to other psychological collectives. Models of collective dynamics thus offer a means to account for collective behavior and collective decisions without appealing to a priori mental structures.

Asymmetry in the Kuramoto model with nonidentical coupling

Synchronization and desynchronization of coupled oscillators appear to be the key property of many physical systems. It is believed that to predict a synchronization (or desynchronization) event, the knowledge on the exact structure of the oscillatory network is required. However, natural sciences often deal with observations where the coupling coefficients are not available. In the present paper we suggest a way to characterize synchronization of two oscillators without the reconstruction of coupling. Our method is based on the Kuramoto chain with three oscillators with constant but nonidentical coupling. We characterize coupling in this chain by two parameters: the coupling strength s and disparity σ. We give an analytical expression of the boundary s_{max} of synchronization occurred when s>s_{max}. We propose asymmetry A of the generalized order parameter induced by the coupling disparity as a new characteristic of the synchronization between two oscillators. For the chain model with three oscillators we present the self-consistent inverse problem. We explore scaling properties of the asymmetry A constructed for the inverse problem. We demonstrate that the asymmetry A in the chain model is maximal when the coupling strength in the model reaches the boundary of synchronization s_{max}. We suggest that the asymmetry A may be derived from the phase difference of any two oscillators if one pretends that they are edges of an abstract chain with three oscillators. Performing such a derivation with the general three-oscillator Kuramoto model, we show that the crossover from the chain to general network of oscillators keeps the interrelation between the asymmetry A and synchronization. Finally, we apply the asymmetry A to describe synchronization of the solar magnetic field proxies and discuss its potential use for the forecast of solar cycle anomalies.

Nonverbal leadership emergence in walking groups

The mechanisms underlying the emergence of leadership in multi-agent systems are under investigation in many areas of research where group coordination is involved. Nonverbal leadership has been mostly investigated in the case of animal groups, and only a few works address the problem in human ensembles, e.g. pedestrian walking, group dance. In this paper we study the emergence of leadership in the specific scenario of a small walking group. Our aim is to propose a rigorous mathematical methodology capable of unveiling the mechanisms of leadership emergence in a human group when leader or follower roles are not designated a priori. Two groups of participants were asked to walk together and turn or change speed at self-selected times. Data were analysed using time-dependent cross correlation to infer leader-follower interactions between each pair of group members. The results indicate that leadership emergence is due both to contextual factors, such as an individual’s position in the group, and to personal factors, such as an individual’s characteristic locomotor behaviour. Our approach can easily be extended to larger groups and other scenarios such as team sports and emergency evacuations.

Can we detect clusters of chaotic dynamical networks via causation entropy?

It is known that chaotic dynamical systems in the coupled networks can synchronize, and they can even form clusters. Our study addresses the issue of determining the membership information of continuous-time dynamical networks forming clusters. We observe the output vectors of individual systems in the networks and reconstruct the state space according to Takens' embedding theorem. Afterward, we estimate the information-theoretic measures in the reconstructed state space. We propose the average integrated causation entropy as a model-free distinctive measure to distinguish the clusters in the network using the k-means clustering algorithm. We have demonstrated the proposed procedure on three networks that contain Chua systems. The results indicate that we can determine the members of clusters and the membership information from the data, conclusively.

Model reconstruction from temporal data for coupled oscillator networks

In a complex system, the interactions between individual agents often lead to emergent collective behavior such as spontaneous synchronization, swarming, and pattern formation. Beyond the intrinsic properties of the agents, the topology of the network of interactions can have a dramatic influence over the dynamics. In many studies, researchers start with a specific model for both the intrinsic dynamics of each agent and the interaction network and attempt to learn about the dynamics of the model. Here, we consider the inverse problem: given data from a system, can one learn about the model and the underlying network? We investigate arbitrary networks of coupled phase oscillators that can exhibit both synchronous and asynchronous dynamics. We demonstrate that, given sufficient observational data on the transient evolution of each oscillator, machine learning can reconstruct the interaction network and identify the intrinsic dynamics.

Discovering the topology of complex networks via adaptive estimators

Behind any complex system in nature or engineering, there is an intricate network of interconnections that is often unknown. Using a control-theoretical approach, we study the problem of network reconstruction (NR): inferring both the network structure and the coupling weights based on measurements of each node's activity. We derive two new methods for NR, a low-complexity reduced-order estimator (which projects each node's dynamics to a one-dimensional space) and a full-order estimator for cases where a reduced-order estimator is not applicable. We prove their convergence to the correct network structure using Lyapunov-like theorems and persistency of excitation. Importantly, these estimators apply to systems with partial state measurements, a broad class of node dynamics and internode coupling functions, and in the case of the reduced-order estimator, node dynamics and internode coupling functions that are not fully known. The effectiveness of the estimators is illustrated using both numerical and experimental results on networks of chaotic oscillators.

Analytical approach to network inference: Investigating degree distribution

When the network is reconstructed, two types of errors can occur: false positive and false negative errors about the presence or absence of links. In this paper, the influence of these two errors on the vertex degree distribution is analytically analyzed. Moreover, an analytic formula of the density of the biased vertex degree distribution is found. In the inverse problem, we find a reliable procedure to reconstruct analytically the density of the vertex degree distribution of any network based on the inferred network and estimates for the false positive and false negative errors based on, e.g., simulation studies.

Clusters in nonsmooth oscillator networks

For coupled oscillator networks with Laplacian coupling, the master stability function (MSF) has proven a particularly powerful tool for assessing the stability of the synchronous state. Using tools from group theory, this approach has recently been extended to treat more general cluster states. However, the MSF and its generalizations require the determination of a set of Floquet multipliers from variational equations obtained by linearization around a periodic orbit. Since closed form solutions for periodic orbits are invariably hard to come by, the framework is often explored using numerical techniques. Here, we show that further insight into network dynamics can be obtained by focusing on piecewise linear (PWL) oscillator models. Not only do these allow for the explicit construction of periodic orbits, their variational analysis can also be explicitly performed. The price for adopting such nonsmooth systems is that many of the notions from smooth dynamical systems, and in particular linear stability, need to be modified to take into account possible jumps in the components of Jacobians. This is naturally accommodated with the use of saltation matrices. By augmenting the variational approach for studying smooth dynamical systems with such matrices we show that, for a wide variety of networks that have been used as models of biological systems, cluster states can be explicitly investigated. By way of illustration, we analyze an integrate-and-fire network model with event-driven synaptic coupling as well as a diffusively coupled network built from planar PWL nodes, including a reduction of the popular Morris-Lecar neuron model. We use these examples to emphasize that the stability of network cluster states can depend as much on the choice of single node dynamics as it does on the form of network structural connectivity. Importantly, the procedure that we present here, for understanding cluster synchronization in networks, is valid for a wide variety of systems in biology, physics, and engineering that can be described by PWL oscillators.