SearcharxivSearch

arXiv · 2412.10062

Dynamical mean-field theory for a highly heterogeneous neural population

Abstract

Large-scale systems with inherent heterogeneity often exhibit complex dynamics that are crucial for their functional properties. However, understanding how such heterogeneity shapes these dynamics remains a significant challenge, particularly in systems with widely varying time scales. To address this, we extend Dynamical Mean Field Theory$\unicode{x2014}$a powerful framework for analyzing large-scale population dynamics$\unicode{x2014}$to systems with heterogeneous temporal properties. Using the population dynamics of a biological neural network as an example, we develop a theoretical framework that determines how inherent heterogeneity influences the critical transition point of the network. By introducing a model that incorporates graded-persistent activity$\unicode{x2014}$a property where certain neurons sustain activity over extended periods without external inputs$\unicode{x2014}$we show that neurons with extremely long timescales shift the system's transition point and expand its dynamical regime, enhancing its suitability for temporal information processing. Furthermore, we validate our framework by applying it to a system with heterogeneous adaptation, demonstrating that such heterogeneity can reduce the dynamical regime, contrary to previous simplified approximations. These findings establish a theoretical foundation for understanding the functional advantages of diversity in complex systems and offer insights applicable to a wide range of heterogeneous networks beyond neural populations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Futa Tomita, Jun-nosuke Teramae. 2024-12-13. Dynamical mean-field theory for a highly heterogeneous neural population. https://arxiv.org/abs/2412.10062

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD