arXiv subjects

Shotaro Takasu

Publications and source records attributed to Shotaro Takasu.

5 recordsLinked to original sources

arXiv2026

Deviations from global coupling in adaptive oscillator networks: a mean-field theory for the variance of coupling weights

A wide range of physical and biological systems are adaptive networks, in which the dynamics of the nodes and of the edges connecting them co-evolve. Mean-field reductions of such systems typically track only the average coupling strength, and therefore cannot determine when the coupling stays effectively homogeneous and when structured connectivity emerges. Here, we present a second-order moment closure that allows us to derive mean-field equations for the coupling-weight variance in networks of heterogeneous phase oscillators with adaptive coupling, starting from uniform coupling weights. In agreement with network simulations, we find a nonlinear, non-monotonic dependence of the relative weight variance on the oscillator heterogeneity that is mediated by the phase coherence. Moreover, we find that deviations from global coupling strongly depend on an interaction between the oscillator heterogeneity and the adaptation rule. Whereas symmetric adaptation causes a strongly coupled core of coherent oscillators to emerge and creates a bistable regime that is absent without adaptation, antisymmetric adaptation leads to antisymmetric coupling within the same core, thereby destabilizing it. Our equations therefore delineate the regimes in which adaptive networks behave like globally coupled systems from those in which more complex coupling patterns form.

nlin.AO↗

arXiv2026

Local connectivity balance shapes population dynamics in random recurrent networks

Disordered dynamical systems comprising many interacting units, from ecological communities to neural circuits, are ubiquitous, and understanding how connectivity shapes their collective behavior is a central theoretical challenge. One long-recognized feature of neural circuits is local connectivity balance, in which the excitatory and inhibitory weights converging onto each unit approximately cancel. Although local connectivity balance has been proposed to serve functions such as gating incoming signals, its effect on collective network dynamics remains unclear. Here we analytically study randomly connected recurrent networks with varying degrees of local connectivity balance. We show that this balance leaves the connectivity spectrum unchanged yet drastically reshapes the dynamics in a manner that depends critically on the single-unit nonlinearity. Local balance suppresses unbounded growth of the network state and stabilizes network dynamics when the activation function scales linearly or faster, whereas it drives the network into chaos when the activation function is sub-linear or saturating. Importantly, these effects vanish for odd activation functions, which are commonly assumed in previous work. We further find that, for saturating nonlinearities, the effective dimension of the dynamics varies nonmonotonically with the degree of balance. We show that all these phenomena arise from a unifying mechanism: the suppression of a self-generated feedback input by local connectivity balance. Our results identify local connectivity balance as a previously overlooked control parameter for collective dynamics in realistic disordered networks.

q-bio.NC↗

arXiv2026

A multi-ensemble mean-field reduction method for networks of globally coupled phase oscillators with arbitrary parameter distributions

Understanding the dynamical properties of coupled phase oscillator systems with heterogeneous oscillator frequencies has been a long-standing challenge of complex systems theory. While the seminal work of Ott and Antonsen dramatically improved our theoretical understanding of coupled phase oscillators for a small family of oscillator frequency distributions, we here present a mean-field reduction method for arbitrary frequency distributions. Our method leverages the drastic dimensionality reduction obtained for Lorentzian frequency distributions, and combines it with a data-driven multi-ensemble approach. As such, the method renders the Ott-Antonsen equations directly applicable to empirical distributions of phase oscillator frequencies, often achieving a drastic dimensionality reduction and allowing to study real-world physical and biological systems by means of stability, sensitivity, and bifurcation analyses.

cond-mat.dis-nn↗

arXiv2025

Neuronal correlations shape the scaling behavior of memory capacity and nonlinear computational capability of reservoir recurrent neural networks

Reservoir computing is a powerful framework for real-time information processing, characterized by its high computational ability and quick learning, with applications ranging from machine learning to biological systems. In this paper, we investigate how the computational ability of reservoir recurrent neural networks (RNNs) scales with an increasing number of readout neurons. First, we demonstrate that the memory capacity of a reservoir RNN scales sublinearly with the number of readout neurons. To elucidate this observation, we develop a theoretical framework for analytically deriving memory capacity that incorporates the effect of neuronal correlations, which have been ignored in prior theoretical work for analytical simplicity. Our theory successfully relates the sublinear scaling of memory capacity to the strength of neuronal correlations. Furthermore, we show this principle holds across diverse types of RNNs, even those beyond the direct applicability of our theory. Next, we numerically investigate the scaling behavior of nonlinear computational ability, which, alongside memory capacity, is crucial for overall computational performance. Our numerical simulations reveal that as memory capacity growth becomes sublinear, increasing the number of readout neurons successively enables nonlinear processing at progressively higher polynomial orders. Our theoretical framework suggests that neuronal correlations govern not only memory capacity but also the sequential growth of nonlinear computational capabilities. Our findings establish a foundation for designing scalable and cost-effective reservoir computing, providing novel insights into the interplay among neuronal correlations, linear memory, and nonlinear processing.

cond-mat.dis-nn↗

arXiv2024

Suppression of chaos in a partially driven recurrent neural network

The dynamics of recurrent neural networks (RNNs), and particularly their response to inputs, play a critical role in information processing. In many applications of RNNs, only a specific subset of the neurons generally receive inputs. However, it remains to be theoretically clarified how the restriction of the input to a specific subset of neurons affects the network dynamics. Considering RNNs with such restricted input, we investigate how the proportion, $p$, of the neurons receiving inputs (the "inputs neurons") and the strength of the input signals affect the dynamics by analytically deriving the conditional maximum Lyapunov exponent. Our results show that for sufficiently large $p$, the maximum Lyapunov exponent decreases monotonically as a function of the input strength, indicating the suppression of chaos, but if $p$ is smaller than a critical threshold, $p_c$, even significantly amplified inputs cannot suppress spontaneous chaotic dynamics. Furthermore, although the value of $p_c$ is seemingly dependent on several model parameters, such as the sparseness and strength of recurrent connections, it is proved to be intrinsically determined solely by the strength of chaos in spontaneous activity of the RNN. This is to say, despite changes in these model parameters, it is possible to represent the value of $p_c$ as a common invariant function by appropriately scaling these parameters to yield the same strength of spontaneous chaos. Our study suggests that if $p$ is above $p_c$, we can bring the neural network to the edge of chaos, thereby maximizing its information processing capacity, by amplifying inputs.

q-bio.NC↗