arXiv subjects

Lyle E. Muller

Publications and source records attributed to Lyle E. Muller.

At least 19 recordsLinked to original sources

arXiv2026

Phase-delays shape multistability and basin sizes in Kuramoto networks: analytical estimates from network structure

We study how network connectivity and heterogeneous phase-delays shape the spatiotemporal dynamics of finite oscillator networks. Phase-delays can destabilize global synchronization and promote phase-locked patterns, including states with uniform phase gradients and more complex combinations of these modes. Yet, how connectivity and phase-delays jointly determine which states the network selects remains unclear. Here, we show that the spectrum of a composite matrix, which combines connectivity and phase-delays, governs not only the linear stability of the network's collective states but also their basin sizes. This, in turn, enables analytical estimates of basin size of phase-locked states for individual networks from connectivity and phase-delays alone. Applying this framework to nonlocal and global networks, including cases with random phase-delays, we uncover multistability and strong asymmetries in basin sizes, revealing chiral dynamics that conventional stability analysis cannot detect.

nlin.AO↗

arXiv2026

Delay coordinates synchronization and induces abrupt transition in excitable networks

Neuronal communication is inherently time-delayed, due to the finite speed of signal propagation. Although often considered challenging or disruptive, such time delays can also endow neural circuits with useful capabilities. Here, we show that delays in excitatory connections between excitable neurons coordinate their synchronization patterns by creating self-sustained oscillations that may be out-of-phase or in-phase. The emergence of these oscillations leads to an abrupt, explosive, transition to in-phase synchronized regimes due to small changes in connection strength or time-delay. We describe the mechanism underlying these phenomena as an interaction between the neuron's excitable dynamics and the delay in signal transmission, explaining many aspects of how the oscillations emerge. We show this phenomenon in different network connectivities, neuronal models, with and without excitation, with and without noise, highlighting the generality of the mechanism.

q-bio.NC↗

arXiv2026

Exact expression for maximum Lyapunov exponent during transients in computationally powerful dynamical networks

We study a network whose rich spatiotemporal dynamics have recently been shown to enable dynamics-based computation, including logic gates, short-term memory, and simple encryption. The network's time dynamics can be exactly solved through a nonlinear coordinate transformation. Here, we derive an exact analytical expression for the network's time-dependent maximum Lyapunov exponent (MLE). We demonstrate, both numerically and analytically, that the network exhibits positive MLEs during the transients that are useful for computation. Our framework enables algebraic manipulation of transient lifetimes through network connectivity and initial conditions, providing a rigorous theoretical foundation for understanding and controlling computation with transients.

nlin.CD↗

arXiv2026

An explicit operator explains end-to-end computation in the modern neural networks used for sequence and language modeling

We establish a mathematical correspondence between state space models, a state-of-the-art architecture for capturing long-range dependencies in data, and an exactly solvable nonlinear oscillator network. As a specific example of this general correspondence, we analyze the diagonal linear time-invariant implementation of the Structured State Space Sequence model (S4). The correspondence embeds S4D, a specific implementation of S4, into a ring network topology, in which recent inputs are encoded, as waves of activity traveling over the one-dimensional spatial layout of the network. We then derive an exact operator expression for the full forward pass of S4D, yielding an analytical characterization of its complete input-output map. This expression reveals that the nonlinear decoder in the system induces interactions between these information-carrying waves that enable classifying real-world sequences. These results generalize across modern SSM architectures, and show that they admit an exact mathematical description with a clear physical interpretation. These insights enable a new level of interpretability for these systems in terms of nonlinear oscillator networks.

cs.NE↗

arXiv2025

Geometric perspective of linear stability in finite networks of nonlinear oscillators

We use a complex-valued transformation of the Kuramoto model to develop an operator-description of the linear stability in finite networks of nonlinear oscillators. This mathematical approach offers analytical predictions for the linear stability of $q$-states, which include phase synchronization ($q = 0$) and waves with different spatial frequencies ($|q| > 0$). This approach seamlessly incorporates the presence of time delays (represented by phase-lags in the coupling). With this, we are able to analytically determine the specific combination of connectivity and time delays (phase-lags) that leads to any given $q$-state to be linearly stable. This approach offers a geometric perspective of linear stability in finite networks in terms of the connectivity and delays (phase-lag), and it opens a path to designing and controlling the spatiotemporal dynamics of individual oscillator networks.

math.DS↗

arXiv2024

A mathematical language for linking fine-scale structure in spikes from hundreds to thousands of neurons with behaviour

Recent advances in neural recording technology allow simultaneously recording action potentials from hundreds to thousands of neurons in awake, behaving animals. However, characterizing spike patterns in the resulting data, and linking these patterns to behaviour, remains a challenging task. The lack of a rigorous mathematical language for variable numbers of events (spikes) emitted by multiple agents (neurons) is an important limiting factor. We introduce a new mathematical operation to decompose complex spike patterns into a set of simple, structured elements. This creates a mathematical language that allows comparing spike patterns across trials, detecting sub-patterns, and making links to behaviour via a clear distance measure. We apply the method to dual Utah array recordings from macaque prefrontal cortex, where this technique reveals previously unseen structure that can predict both memory-guided decisions and errors in a virtual-reality working memory task. These results demonstrate that this technique provides a powerful new approach to understand structure in the spike times of neural populations, at a scale that will continue to grow more and more rapidly in upcoming years.

q-bio.QM↗

arXiv2023

An exact mathematical description of computation with transient spatiotemporal dynamics in a complex-valued neural network

We study a complex-valued neural network (cv-NN) with linear, time-delayed interactions. We report the cv-NN displays sophisticated spatiotemporal dynamics, including partially synchronized ``chimera'' states. We then use these spatiotemporal dynamics, in combination with a nonlinear readout, for computation. The cv-NN can instantiate dynamics-based logic gates, encode short-term memories, and mediate secure message passing through a combination of interactions and time delays. The computations in this system can be fully described in an exact, closed-form mathematical expression. Finally, using direct intracellular recordings of neurons in slices from neocortex, we demonstrate that computations in the cv-NN are decodable by living biological neurons. These results demonstrate that complex-valued linear systems can perform sophisticated computations, while also being exactly solvable. Taken together, these results open future avenues for design of highly adaptable, bio-hybrid computing systems that can interface seamlessly with other neural networks.

cs.NE↗

arXiv2023

Image segmentation with traveling waves in an exactly solvable recurrent neural network

We study image segmentation using spatiotemporal dynamics in a recurrent neural network where the state of each unit is given by a complex number. We show that this network generates sophisticated spatiotemporal dynamics that can effectively divide an image into groups according to a scene's structural characteristics. Using an exact solution of the recurrent network's dynamics, we present a precise description of the mechanism underlying object segmentation in this network, providing a clear mathematical interpretation of how the network performs this task. We then demonstrate a simple algorithm for object segmentation that generalizes across inputs ranging from simple geometric objects in grayscale images to natural images. Object segmentation across all images is accomplished with one recurrent neural network that has a single, fixed set of weights. This demonstrates the expressive potential of recurrent neural networks when constructed using a mathematical approach that brings together their structure, dynamics, and computation.

cs.CV↗

arXiv2023

Theory of transient chimeras in finite Sakaguchi-Kuramoto networks

Chimera states are a phenomenon in which order and disorder can co-exist within a network that is fully homogeneous. Precisely how transient chimeras emerge in finite networks of Kuramoto oscillators with phase-lag remains unclear. Utilizing an operator-based framework to study nonlinear oscillator networks at finite scale, we reveal the spatiotemporal impact of the adjacency matrix eigenvectors on the Sakaguchi-Kuramoto dynamics. We identify a specific condition for the emergence of transient chimeras in these finite networks: the eigenvectors of the network adjacency matrix create a combination of a zero phase-offset mode and low spatial frequency waves traveling in opposite directions. This combination of eigenvectors leads directly to the coherent and incoherent clusters in the chimera. This approach provides two specific analytical predictions: (1) a precise formula predicting the combination of connectivity and phase-lag that creates transient chimeras, (2) a mathematical procedure for rewiring arbitrary networks to produce transient chimeras.

nlin.CD↗

arXiv2023

Composed solutions of synchronized patterns in multiplex networks of Kuramoto oscillators

Networks with different levels of interactions, including multilayer and multiplex networks, can display a rich diversity of dynamical behaviors and can be used to model and study a wide range of systems. Despite numerous efforts to investigate these networks, obtaining mathematical descriptions for the dynamics of multilayer and multiplex systems is still an open problem. Here, we combine ideas and concepts from linear algebra and graph theory with nonlinear dynamics to offer a novel approach to study multiplex networks of Kuramoto oscillators. Our approach allows us to study the dynamics of a large, multiplex network by decomposing it into two smaller systems: one representing the connection scheme within layers (intra-layer), and the other representing the connections between layers (inter-layer). Particularly, we use this approach to compose solutions for multiplex networks of Kuramoto oscillators. These solutions are given by a combination of solutions for the smaller systems given by the intra and inter-layer system and, in addition, our approach allows us to study the linear stability of these solutions.

math.DS↗

arXiv2023

Broadcasting solutions on networked systems of phase oscillators

Networked systems have been used to model and investigate the dynamical behavior of a variety of systems. For these systems, different levels of complexity can be considered in the modeling procedure. On one hand, this can offer a more realistic and rich modeling option. On the other hand, it can lead to intrinsic difficulty in analyzing the system. Here, we present an approach to investigate the dynamics of Kuramoto oscillators on networks with different levels of connections: a network of networks. To do so, we utilize a construction in network theory known as the join of networks, which represents ``intra-area" and ``inter-area" connections. This approach provides a reduced representation of the original, multi-level system, where both systems have equivalent dynamics. Then, we can find solutions for the reduced system and broadcast them to the original network of networks. Moreover, using the same idea we can investigate the stability of these states, where we can obtain information on the Jacobian of the multi-level system by analyzing the reduced one. This approach is general for arbitrary connection schemes between nodes within the same area. Finally, our work opens the possibility of studying the dynamics of networked systems using a simpler representation, thus leading to a better understanding of the dynamical behavior of these systems.

math.DS↗

arXiv2023

Analytical prediction of specific spatiotemporal patterns in nonlinear oscillator networks with distance-dependent time delays

We introduce an analytical approach that allows predictions and mechanistic insights into the dynamics of nonlinear oscillator networks with heterogeneous time delays. We demonstrate that time delays shape the spectrum of a matrix associated to the system, leading to the emergence of waves with a preferred direction. We then create analytical predictions for the specific spatiotemporal patterns observed in individual simulations of time-delayed Kuramoto networks. This approach generalizes to systems with heterogeneous time delays at finite scales, which permits the study of spatiotemporal dynamics in a broad range of applications.

math.DS↗

arXiv2022

Equilibria in Kuramoto oscillator networks: An algebraic approach

Kuramoto networks constitute a paradigmatic model for the investigation of collective behavior in networked systems. Despite many advances in recent years, many open questions remain on the solutions for systems composed of coupled Kuramoto oscillators on complex networks. In this article, we describe an algebraic method to find equilibrium points for this kind of system without using standard approximations in the limit of infinite system size or the continuum limit. To do this, we use a recently introduced algebraic approach to the Kuramoto dynamics, which results in an explicitly solvable complex-valued equation that captures the dynamics of the original Kuramoto model. Using this new approach, we obtain equilibria for both the nonlinear original Kuramoto and complex-valued systems. We then completely classify all equilibria in the case of complete graphs originally studied by Kuramoto. Finally, we go on to study equilibria in networks of coupled oscillators with phase lag, in generalized circulant networks, multi-layer networks, and also random networks.

math.DS↗

arXiv2022

Small changes at single nodes can shift global network dynamics

Understanding the sensitivity of a system's behavior with respect to parameter changes is essential for many applications. This sensitivity may be desired - for instance in the brain, where a large repertoire of different dynamics, particularly different synchronization patterns, is crucial - or may be undesired - for instance in power grids, where disruptions to synchronization may lead to blackouts. In this work, we show that the dynamics of networks of phase oscillators can acquire a very large and complex sensitivity to changes made in either their units' parameters or in their connections - even modifications made to a parameter of a single unit can radically alter the global dynamics of the network in an unpredictable manner. As a consequence, each modification leads to a different path to phase synchronization manifested as large fluctuations along that path. This dynamical malleability occurs over a wide parameter region, around the network's two transitions to phase synchronization. One transition is induced by increasing the coupling strength between the units, and another is induced by increasing the prevalence of long-range connections. Specifically, we study Kuramoto phase oscillators connected under either Watts-Strogatz or distance-dependent topologies to analyze the statistical properties of the fluctuations along the paths to phase synchrony. We argue that this increase in the dynamical malleability is a general phenomenon, as suggested by both previous studies and the theory of phase transitions.

math.DS↗

arXiv2022

Geometry unites synchrony, chimeras, and waves in nonlinear oscillator networks

One of the simplest mathematical models in the study of nonlinear systems is the Kuramoto model, which describes synchronization in systems from swarms of insects to superconductors. We have recently found a connection between the original, real-valued nonlinear Kuramoto model and a corresponding complex-valued system that permits describing the system in terms of a linear operator and iterative update rule. We now use this description to investigate three major synchronization phenomena in Kuramoto networks (phase synchronization, chimera states, and traveling waves), not only in terms of steady state solutions but also in terms of transient dynamics and individual simulations. These results provide new mathematical insight into how sophisticated behaviors arise from connection patterns in nonlinear networked systems.

math.DS↗

arXiv2014

Percolation in Random Graphs: A Finite Approach

We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which scales in accordance with results obtained for infinite random graphs using the emergence of a giant connected component as marking the percolation transition. Our approach is general and can be applied to all graph models for which an algebraic formulation of the adjacency matrix is available.

cond-mat.stat-mech↗

arXiv2014

On an explicit representation of central $(2k+1)$-nomial coefficients

We propose an explicit representation of central $(2k+1)$-nomial coefficients in terms of finite sums over trigonometric constructs. The approach utilizes the diagonalization of circulant boolean matrices and is generalizable to all $(2k+1)$-nomial coefficients, thus yielding a new family of combinatorical identities.

math.CO↗

arXiv2013

Aspects of randomness in neural graph structures

In the past two decades, significant advances have been made in understanding the structural and functional properties of biological networks, via graph-theoretic analysis. In general, most graph-theoretic studies are conducted in the presence of serious uncertainties, such as major undersampling of the experimental data. In the specific case of neural systems, however, a few moderately robust experimental reconstructions do exist, and these have long served as fundamental prototypes for studying connectivity patterns in the nervous system. In this paper, we provide a comparative analysis of these "historical" graphs, both in (unmodified) directed and (often symmetrized) undirected forms, and focus on simple structural characterizations of their connectivity. We find that in most measures the networks studied are captured by simple random graph models; in a few key measures, however, we observe a marked departure from the random graph prediction. Our results suggest that the mechanism of graph formation in the networks studied is not well-captured by existing abstract graph models, such as the small-world or scale-free graph.

physics.soc-ph↗