Searcharxiv⌕ Search

arXiv subjects

Gemma Huguet

Publications and source records attributed to Gemma Huguet.

13 recordsLinked to original sources

Emergent Spatiotemporal Dynamics in Large-Scale Brain Networks with Next Generation Neural Mass Models

Understanding the dynamics of large-scale brain models remains a central challenge due to the inherent complexity of these systems. In this work, we explore the emergence of complex spatiotemporal patterns in a large scale-brain model composed of 90 interconnected brain regions coupled through empirically derived anatomical connectivity. An important aspect of our formulation is that the local dynamics of each brain region are described by a next-generation neural mass model, which explicitly captures the macroscopic gamma activity of coupled excitatory and inhibitory neural populations (PING mechanism). We first identify the system's homogeneous states-both resting and oscillatory-and analyze their stability under uniform perturbations. Then, we determine the stability against non-uniform perturbations by obtaining dispersion relations for the perturbation growth rate. This analysis enables us to link unstable directions of the homogeneous solutions to the emergence of rich spatiotemporal patterns, that we characterize by means of Lyapunov exponents and frequency spectrum analysis. Our results show that, compared to previous studies with classical neural mass models, next-generation neural mass models provide a broader dynamical repertoire, both within homogeneous states and in the heterogeneous regime. Additionally, we identify a key role for anatomical connectivity in cross-frequency coupling, allowing for the emergence of gamma oscillations with amplitude modulated by slower rhythms. These findings suggest that such models are not only more biophysically grounded but also particularly well-suited to capture the full complexity of large-scale brain dynamics. Overall, our study advances the analytical understanding of emerging spatiotemporal patterns in whole-brain models.

q-bio.NC↗

Efficient Numerical Algorithms for Phase-Amplitude Reduction on the Slow Attracting Manifold of Limit cycles

The phase-amplitude framework extends the classical phase reduction method by incorporating amplitude coordinates (or isostables) to describe transient dynamics transverse to the limit cycle in a simplified form. While the full set of amplitude coordinates provides an exact description of oscillatory dynamics, it maintains the system's original dimensionality, limiting the advantages of simplification. A more effective approach reduces the dynamics to the slow attracting invariant submanifold associated with the slowest contracting direction, achieving a balance between simplification and accuracy. In this work, we present an efficient numerical method to compute the parameterization of the attracting slow submanifold of hyperbolic limit cycles and the simplified dynamics in its induced coordinates. Additionally, we compute the infinitesimal Phase and Amplitude Response Functions (iPRF and iARF, respectively) restricted to this manifold, which characterize the effects of perturbations on phase and amplitude. These results are obtained by solving an invariance equation for the slow manifold and adjoint equations for the iPRF and iARF. To solve these functional equations efficiently, we employ the Floquet normal form to solve the invariance equation and propose a novel coordinate transformation to simplify the adjoint equations. The solutions are expressed as Fourier-Taylor expansions with arbitrarily high accuracy. Our method accommodates both real and complex Floquet exponents. Finally, we discuss the numerical implementation of the method and present results from its application to a representative example.

math.DS↗

Reconstruction of phase-amplitude dynamics from electrophysiological signals

We present a novel method of reconstructing the phase-amplitude dynamics directly from measured electrophysiological signals to estimate the coupling between brain regions. For this purpose, we use the recent advances in the field of phase-amplitude reduction of oscillatory systems, which allow the representation of an uncoupled oscillatory system as a phase-amplitude oscillator in a unique form using transformations (parameterizations) related to the eigenfunctions of the Koopman operator. By combining the parameterization method and the Fourier-Laplace averaging method for finding the eigenfunctions of the Koopman operator, we developed a method of assessing the transformation functions from the signals of the interacting oscillatory systems. The resulting reconstructed dynamical system is a network of phase-amplitude oscillators with the interactions between them represented as coupling functions in phase and amplitude coordinates.

math.DS↗

Optimal control of oscillatory neuronal models with applications to communication through coherence

Macroscopic oscillations in the brain are involved in various cognitive and physiological processes, yet their precise function is not not completely understood. Communication Through Coherence (CTC) theory proposes that these rhythmic electrical patterns might serve to regulate the information flow between neural populations. Thus, to communicate effectively, neural populations must synchronize their oscillatory activity, ensuring that input volleys from the presynaptic population reach the postsynaptic one at its maximum phase of excitability. We consider an Excitatory-Inhibitory (E-I) network whose macroscopic activity is described by an exact mean-field model. The E-I network receives periodic inputs from either one or two external sources, for which effective communication will not be achieved in the absence of control. We explore strategies based on optimal control theory for phase-amplitude dynamics to design a control that sets the target population in the optimal phase to synchronize its activity with a specific presynaptic input signal and establish communication. The control mechanism resembles the role of a higher cortical area in the context of selective attention. To design the control, we use the phase-amplitude reduction of a limit cycle and leverage recent developments in this field in order to find the most effective control strategy regarding a defined cost function. Furthermore, we present results that guarantee the local controllability of the system close to the limit cycle.

q-bio.NC↗

Traveling waves in a model for cortical spreading depolarization with slow-fast dynamics

Cortical spreading depression and spreading depolarization (CSD) are waves of neuronal depolarization that spread across the cortex, leading to a temporary saturation of brain activity. They are associated to various brain disorders such as migraine and ischemia. We consider a reduced version of a biophysical model of a neuron-astrocyte network for the initiation and propagation of CSD waves (Huguet et al., Biophys. J. , 2016), consisting of reaction-diffusion equations. The reduced model considers only the dynamics of the neuronal and astrocytic membrane potentials and the extracellular potassium concentration, capturing the instigation process implicated in such waves. We present a computational and mathematical framework based on the parameterization method and singular perturbation theory to provide semi-analytical results on the existence of a wave solution and to compute it jointly with its velocity of propagation. The traveling wave solution can be seen as an heteroclinic connection of an associated system of ordinary differential equations with a slow-fast dynamics. The presence of distinct time scales within the system introduces numerical instabilities, which we successfully address through the identification of significant invariant manifolds and the implementation of the parameterization method. Our results provide a methodology that allows to identify efficiently and accurately the mechanisms responsible for the initiation of these waves and the wave propagation velocity.

math.DS↗

Global phase-amplitude description of oscillatory dynamics via the parameterization method

In this paper we use the parameterization method to provide a complete description of the dynamics of an $n$-dimensional oscillator beyond the classical phase reduction. The parameterization method allows, via efficient algorithms, to obtain a parameterization of the attracting invariant manifold of the limit cycle in terms of the phase-amplitude variables. The method has several advantages. It provides analytically a Fourier-Taylor expansion of the parameterization up to any order, as well as a simplification of the dynamics that allows for a numerical globalization of the manifolds. Thus, one can obtain the local and global isochrons and isostables, including the slow attracting manifold, up to high accuracy, which offer a geometrical portrait of the oscillatory dynamics. Furthermore, it provides straightforwardly the infinitesimal Phase and Amplitude Response Functions, that is, the extended infinitesimal Phase and Amplitude Response Curves, which monitor the phase and amplitude shifts beyond the asymptotic state. Thus, the methodology presented yields an accurate description of the phase dynamics for perturbations not restricted to the limit cycle but to its attracting invariant manifold. Finally, we explore some strategies to reduce the dimension of the dynamics, including the reduction of the dynamics to the slow stable submanifold. We illustrate our methods by applying them to different three dimensional single neuron and neural population models in neuroscience.

math.DS↗

Phase-locked states in oscillating neural networks and their role in neural communication

The theory of communication through coherence (CTC) proposes that brain oscillations reflect changes in the excitability of neurons, and therefore the successful communication between two oscillating neural populations depends not only on the strength of the signal emitted but also on the relative phases between them. More precisely, effective communication occurs when the emitting and receiving populations are properly phase locked so the inputs sent by the emitting population arrive at the phases of maximal excitability of the receiving population. To study this setting, we consider a population rate model consisting of excitatory and inhibitory cells modelling the receiving population, and we perturb it with a time-dependent periodic function modelling the input from the emitting population. We consider the stroboscopic map for this system and compute numerically the fixed and periodic points of this map and their bifurcations as the amplitude and the frequency of the perturbation are varied. From the bifurcation diagram, we identify the phase-locked states as well as different regions of bistability. We explore carefully the dynamics emphasizing its implications for the CTC theory. In particular, we study how the input gain depends on the timing between the input and the inhibitory action of the receiving population. Our results show that naturally an optimal phase locking for CTC emerges, and provide a mechanism by which the receiving population can implement selective communication. Moreover, the presence of bistable regions, suggests a mechanism by which different communication regimes between brain areas can be established without changing the structure of the network

q-bio.NC↗

A geometric approach to Phase Response Curves and its numerical computation through the parameterization method

The Phase Response Curve (PRC) is a tool used in neuroscience that measures the phase shift experienced by an oscillator due to a perturbation applied at different phases of the limit cycle. In this paper we present a new approach to PRCs based on the parameterization method. The underlying idea relies on the construction of a periodic system whose corresponding stroboscopic map has an invariant curve. We demonstrate the relationship between the internal dynamics of this invariant curve and the PRC, which yields a method to numerically compute the PRCs. Moreover, we link the existence properties of this invariant curve as the amplitude of the perturbation is increased with changes in the PRC waveform and with the geometry of isochrons. The invariant curve and its dynamics will be computed by means of the parameterization method consisting of solving an invariance equation. We show that the method to compute the PRC can be extended beyond the breakdown of the curve by means of introducing a modified invariance equation. The method also computes the amplitude response functions (ARCs) which provide information on the displacement away from the oscillator due to the effects of the perturbation. Finally, we apply the method to several classical models in neuroscience to illustrate how the results herein extend the framework of computation and interpretation of the PRC and ARC for perturbations of large amplitude and not necessarily pulsatile.

math.DS↗

Quasi-periodic perturbations of heteroclinic attractor networks

We consider heteroclinic attractor networks motivated by models of competition between neural populations during binocular rivalry. We show that Gamma distributions of dominance times observed experimentally in binocular rivalry and other forms of bistable perception, commonly explained by means of noise in the models, can be achieved with quasi-periodic perturbations. For this purpose, we present a methodology based on the separatrix map to model the dynamics close to heteroclinic networks with quasi-periodic perturbations. Our methodology unifies two different approaches, one based on Melnikov integrals and another one based on variational equations. We apply it to two models: first, to the Duffing equation, which comes from the perturbation of a Hamiltonian system and, second, to a heteroclinic attractor network for binocular rivalry, for which we develop a suitable method based on Melnikov integrals for non-Hamiltonian systems. In both models, the perturbed system shows chaotic behavior while dominance times achieve good agreement with Gamma distributions. Moreover, the separatrix map provides a new (discrete) model for bistable perception which, in addition, replaces the numerical integration of time-continuous models and, consequently, reduces the computational cost and avoids numerical instabilities.

math.DS↗

Gluing and grazing bifurcations in periodically forced 2-dimensional integrate-and-fire models

In this work we consider a general class of $2$-dimensional hybrid systems. Assuming that the system possesses an attracting equilibrium point, we show that, when periodically driven with a square-wave pulse, the system possesses a periodic orbit which may undergo smooth and nonsmooth grazing bifurcations. We perform a semi-rigorous study of the existence of periodic orbits for a particular model consisting of a leaky integrate-and-fire model with a dynamic threshold. We use the stroboscopic map, which in this context is a $2$-dimensional piecewise-smooth discontinuous map. For some parameter values we are able to show that the map is a quasi-contraction possessing a (locally) unique maximin periodic orbit. We complement our analysis using advanced numerical techniques to provide a complete portrait of the dynamics as parameters are varied. We find that for some regions of the parameter space the model undergoes a cascade of gluing bifurcations, while for others the model shows multistability between orbits of different periods.

math.DS↗

Fast iteration of cocyles over rotations and Computation of hyperbolic bundles

In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of hyperbolic cocycles over a rotation. We present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori.

math.DS↗

A geometric mechanism of diffusion: Rigorous verification in a priori unstable Hamiltonian systems

In this paper we consider a representative a priori unstable Hamiltonian system with 2+1/2 degrees of freedom, to which we apply the geometric mechanism for diffusion introduced in the paper Delshams et al., Mem. Amer. Math. Soc. 2006, and generalized in Delshams and Huguet, Nonlinearity 2009, and provide explicit, concrete and easily verifiable conditions for the existence of diffusing orbits. The simplification of the hypotheses allows us to perform explicitly the computations along the proof, which contribute to present in an easily understandable way the geometric mechanism of diffusion. In particular, we fully describe the construction of the scattering map and the combination of two types of dynamics on a normally hyperbolic invariant manifold

math.DS↗

Computation of whiskered invariant tori and their associated manifolds: new fast algorithms

In this paper we present efficient algorithms for the computation of several invariant objects for Hamiltonian dynamics. More precisely, we consider KAM tori (i.e diffeomorphic copies of the torus such that the motion on them is conjugated to a rigid rotation) both Lagrangian tori (of maximal dimension) and whiskered tori (i.e. tori with hyperbolic directions which, together with the tangents to the torus and the symplectic conjugates span the whole tangent space). In the case of whiskered tori, we also present algorithms to compute the invariant splitting and the invariant manifolds associated to the splitting. We present them both for the case of discrete time and for differential equations. The algorithms are based on a Newton method to solve an appropriately chosen functional equation that expresses invariance. The algorithms are efficient: if we discretize the objects by $N$ elements, one step of the Newton method requires only O(N) storage and $O(N \ln(N))$ operations. Furthermore, if the object we consider is of dimension $\ell$, we only need to compute functions of $\ell$ variables, independently of what is the dimension of the phase space. The algorithms do not require that the system is presented in action-angle variables nor that it is close to integrable. The algorithms are backed up by rigorous \emph{a-posteriori} bounds which state that if the equations are solved with a small residual and some explicitly computable condition numbers are not too big, then, there is a true solution which is close to the computed one. The algorithms apply both to primary (i.e non-contractible) and secondary tori (i.e. contractible to a torus of lower dimension, such as islands). They have already been implemented. We will report on the technicalities of the implementation and the results of running them elsewhere.

math.DS↗