Ordinal Poincaré sections: Reconstructing the first return map from an ordinal segmentation of time series.

We propose a robust algorithm for constructing first return maps of dynamical systems from time series without the need for embedding. A first return map is typically constructed using a convenient heuristic (maxima or zero-crossings of the time series, for example) or a computationally nuanced geometric approach (explicitly constructing a Poincaré section from a hyper-surface normal to the flow and then interpolating to determine intersections with trajectories). Our method is based on ordinal partitions of the time series, and the first return map is constructed from successive intersections with specific ordinal sequences. We can obtain distinct first return maps for each ordinal sequence in general. We define entropy-based measures to guide our selection of the ordinal sequence for a "good" first return map and show that this method can robustly be applied to time series from classical chaotic systems to extract the underlying first return map dynamics. The results are shown for several well-known dynamical systems (Lorenz, Rössler, and Mackey-Glass in chaotic regimes).

Reservoir computing with swarms.

We study swarms as dynamical systems for reservoir computing (RC). By example of a modified Reynolds boids model, the specific symmetries and dynamical properties of a swarm are explored with respect to a nonlinear time-series prediction task. Specifically, we seek to extract meaningful information about a predator-like driving signal from the swarm's response to that signal. We find that the naïve implementation of a swarm for computation is very inefficient, as permutation symmetry of the individual agents reduces the computational capacity. To circumvent this, we distinguish between the computational substrate of the swarm and a separate observation layer, in which the swarm's response is measured for use in the task. We demonstrate the implementation of a radial basis-localized observation layer for this task. The behavior of the swarm is characterized by order parameters and measures of consistency and related to the performance of the swarm as a reservoir. The relationship between RC performance and swarm behavior demonstrates that optimal computational properties are obtained near a phase transition regime.

Learned emergence in selfish collective motion.

To understand the collective motion of many individuals, we often rely on agent-based models with rules that may be computationally complex and involved. For biologically inspired systems in particular, this raises questions about whether the imposed rules are necessarily an accurate reflection of what is being followed. The basic premise of updating one's state according to some underlying motivation is well suited to the realm of reservoir computing; however, entire swarms of individuals are yet to be tasked with learning movement in this framework. This work focuses on the specific case of many selfish individuals simultaneously optimizing their domains in a manner conducive to reducing their personal risk of predation. Using an echo state network and data generated from the agent-based model, we show that, with an appropriate representation of input and output states, this selfish movement can be learned. This suggests that a more sophisticated neural network, such as a brain, could also learn this behavior and provides an avenue to further the search for realistic movement rules in systems of autonomous individuals.

Mobility data shows effectiveness of control strategies for COVID-19 in remote, sparse and diffuse populations.

Data that is collected at the individual-level from mobile phones is typically aggregated to the population-level for privacy reasons. If we are interested in answering questions regarding the mean, or working with groups appropriately modeled by a continuum, then this data is immediately informative. However, coupling such data regarding a population to a model that requires information at the individual-level raises a number of complexities. This is the case if we aim to characterize human mobility and simulate the spatial and geographical spread of a disease by dealing in discrete, absolute numbers. In this work, we highlight the hurdles faced and outline how they can be overcome to effectively leverage the specific dataset: Google COVID-19 Aggregated Mobility Research Dataset (GAMRD). Using a case study of Western Australia, which has many sparsely populated regions with incomplete data, we firstly demonstrate how to overcome these challenges to approximate absolute flow of people around a transport network from the aggregated data. Overlaying this evolving mobility network with a compartmental model for disease that incorporated vaccination status we run simulations and draw meaningful conclusions about the spread of COVID-19 throughout the state without de-anonymizing the data. We can see that towns in the Pilbara region are highly vulnerable to an outbreak originating in Perth. Further, we show that regional restrictions on travel are not enough to stop the spread of the virus from reaching regional Western Australia. The methods explained in this paper can be therefore used to analyze disease outbreaks in similarly sparse populations. We demonstrate that using this data appropriately can be used to inform public health policies and have an impact in pandemic responses.