Publications by authors named "Michael Small"

Community detection plays a crucial role in understanding the structural organization of complex networks. Previous methods, particularly those from statistical physics, primarily focus on the analysis of mesoscopic network structures and often struggle to integrate fine-grained node similarities. To address this limitation, we propose a low-complexity framework that integrates machine learning to embed micro-level node-pair similarities into mesoscopic community structures.

View Article and Find Full Text PDF

Most previous studies on eigenspectral analysis of synchronization have focused on static multilayer networks with pairwise interactions. In this work, we extend the analysis to time-varying multilayer networks with higher-order interactions. Specifically, we consider two types of multilayer connections, namely, multiplex and interconnected networks.

View Article and Find Full Text PDF

We use the minimum description length (MDL) principle, which is an information-theoretic criterion for model selection, to determine echo-state network readout subsets. We find that this method of MDL subset selection improves accuracy when forecasting the Lorenz, Rössler, and Thomas attractors. It also improves the performance benefit that occurs when higher-order terms are included in the readout layer.

View Article and Find Full Text PDF

We propose a novel Reservoir Computing (RC) based classification method that distinguishes between different chaotic time series. Our method is composed of two steps: (i) we use the reservoir as a feature extracting machine that captures the salient features of time series data; (ii) the readout layer of the reservoir is subsequently fed into a Convolutional Neural Network (CNN) to facilitate classification and recognition. One of the notable advantages is that the readout layer, as obtained by randomly generated empirical hyper-parameters within the RC module, provides sufficient information for the CNN to accomplish the classification tasks effectively.

View Article and Find Full Text PDF

In recent studies, it has been established that higher-order interactions in coupled oscillators can induce a process from continuous to explosive phase transition. In this study, we identify a phase transition, termed the stepwise explosive phase transition, characterized by the emergence of multiple critical phase plateaus in a globally frequency-weighted coupled pendulum model. This transition bridges the continuous and explosive phase transitions, arising from a delicate balance between attractive higher-order interactions and repulsive pairwise interactions.

View Article and Find Full Text PDF

While the assumption that dynamical systems are stationary is common for modeling purposes, in reality, this is rarely the case. Rather, these systems can change over time, a phenomenon referred to as concept drift in the modeling community. While there exist numerous statistics-based methods for concept drift detection on stochastic processes, approaches leveraging nonlinear time series analysis (NTSA) are rarer but seeing increased focus in cases where the processes are deterministic.

View Article and Find Full Text PDF

We propose a universal method based on deep reinforcement learning (specifically, soft actor-critic) to control the chimera state in the coupled oscillators. The policy for control is learned by maximizing the expectation of the cumulative reward in the reinforcement learning framework. With the aid of the local order parameter, we design a class of reward functions for controlling the chimera state, specifically confining the spatial position of coherent and incoherent domains to any desired lateral position of oscillators.

View Article and Find Full Text PDF

We propose a mutual information statistic to quantify the information encoded by a partition of the state space of a dynamical system. We measure the mutual information between each point's symbolic trajectory history under a coarse partition (one with few unique symbols) and its partition assignment under a fine partition (one with many unique symbols). When applied to a set of test cases, this statistic demonstrates predictable and consistent behavior.

View Article and Find Full Text PDF

This Focus Issue covers recent developments in the broad areas of nonlinear dynamics, synchronization, and emergent behavior in dynamical networks. It targets current progress on issues such as time series analysis and data-driven modeling from real data such as climate, brain, and social dynamics. Predicting and detecting early warning signals of extreme climate conditions, epileptic seizures, or other catastrophic conditions are the primary tasks from real or experimental data.

View Article and Find Full Text PDF

The spread of misinformation on social media is inextricably related to each user's forwarding habits. In this paper, given that users have heterogeneous forwarding probabilities to their neighbors with varied relationships when they receive misinformation, we present a novel ignorant-spreader-refractory (ISR) spreading model with heterogeneous spreading rates on activity-driven networks with various types of links that encode these differential relationships. More exactly, in this model, the same type of links has an identical spreading rate, while different types of links have distinct ones.

View Article and Find Full Text PDF

Networks are designed to ensure proper functioning and sustained operability of the underlying systems. However, disruptions are generally unavoidable. Internal interactions and external environmental effects can lead to the removal of nodes or edges, resulting in unexpected collective behavior.

View Article and Find Full Text PDF

Continuous-state network spreading models provide critical numerical and analytic insights into transmission processes in epidemiology, rumor propagation, knowledge dissemination, and many other areas. Most of these models reflect only local features such as adjacency, degree, and transitivity, so can exhibit substantial error in the presence of global correlations typical of empirical networks. Here, we propose mitigating this limitation via a network property ideally suited to capturing spreading.

View Article and Find Full Text PDF

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.

View Article and Find Full Text PDF

The reservoir computing approach utilizes a time series of measurements as input to a high-dimensional dynamical system known as a reservoir. However, the approach relies on sampling a random matrix to define its underlying reservoir layer, which leads to numerous hyperparameters that need to be optimized. Here, we propose a nonlocally coupled pendulum model with higher-order interactions as a novel reservoir, which requires no random underlying matrices and fewer hyperparameters.

View Article and Find Full Text PDF

Searching for key nodes and edges in a network is a long-standing problem. Recently cycle structure in a network has received more attention. Is it possible to propose a ranking algorithm for cycle importance? We address the problem of identifying the key cycles of a network.

View Article and Find Full Text PDF

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.

View Article and Find Full Text PDF

Network correlation dimension governs the distribution of network distance in terms of a power-law model and profoundly impacts both structural properties and dynamical processes. We develop new maximum likelihood methods which allow us robustly and objectively to identify network correlation dimension and a bounded interval of distances over which the model faithfully represents structure. We also compare the traditional practice of estimating correlation dimension by modeling as a power law the fraction of nodes within a distance to a proposed alternative of modeling as a power law the fraction of nodes at a distance.

View Article and Find Full Text PDF

Delay embedding methods are a staple tool in the field of time series analysis and prediction. However, the selection of embedding parameters can have a big impact on the resulting analysis. This has led to the creation of a large number of methods to optimize the selection of parameters such as embedding lag.

View Article and Find Full Text PDF

The ongoing COVID-19 pandemic has inflicted tremendous economic and societal losses. In the absence of pharmaceutical interventions, the population behavioral response, including situational awareness and adherence to non-pharmaceutical intervention policies, has a significant impact on contagion dynamics. Game-theoretic models have been used to reproduce the concurrent evolution of behavioral responses and disease contagion, and social networks are critical platforms on which behavior imitation between social contacts, even dispersed in distant communities, takes place.

View Article and Find Full Text PDF

While reservoir computing (RC) has demonstrated astonishing performance in many practical scenarios, the understanding of its capability for generalization on previously unseen data is limited. To address this issue, we propose a novel generalization bound for RC based on the empirical Rademacher complexity under the probably approximately correct learning framework. Note that the generalization bound for the RC is derived in terms of the model hyperparameters.

View Article and Find Full Text PDF

Non-recurrent congestion disrupts normal traffic operations and lowers travel time (TT) reliability, which leads to many negative consequences such as difficulties in trip planning, missed appointments, loss in productivity, and driver frustration. Traffic incidents are one of the six causes of non-recurrent congestion. Early and accurate detection helps reduce incident duration, but it remains a challenge due to the limitation of current sensor technologies.

View Article and Find Full Text PDF

We present the idea of reservoir time series analysis (RTSA), a method by which the state space representation generated by a reservoir computing (RC) model can be used for time series analysis. We discuss the motivation for this with reference to the characteristics of RC and present three ad hoc methods for generating representative features from the reservoir state space. We then develop and implement a hypothesis test to assess the capacity of these features to distinguish signals from systems with varying parameters.

View Article and Find Full Text PDF