1 January 2009 in SIAM Journal on Applied Dynamical Systems
This work arises from the purpose of applying new tools in dynamical systems to time problems in biological systems. The main aim of this paper is to develop a numerical method to perform the effective computation of the phase advancement when we stimulate an oscillator which has not yet reached the asymptotic state (a limit cycle). That is, we want to extend the computation of the phase resetting curves (PRCs) (the classical tool to compute the phase advancement) to a neighborhood of the limit cycle, obtaining what we call the phase resetting surfaces (PRSs). To achieve this goal we first perform a careful study of the theoretical grounds (the parameterization method for invariant manifolds and another approach using Lie symmetries), which allows us to describe the isochronous sections of the limit cycle and, from them, to obtain the PRSs. In order to make this theoretical framework applicable, we use the numerical algorithms of the parameterization method and other semianalytical tools to extend invariant manifolds; as a result, we design a numerical scheme to compute both the isochrons and the PRSs of a given oscillator. Finally, to illustrate this algorithm, we apply it to some well-known biological models and we include a discussion on different biological and numerical aspects suggested by these examples.
27 February 2014 in Journal of Vision
We study the dynamics of perceptual switching in ambiguous visual scenes that admit more than two interpretations/percepts to gain insight into the dynamics of perceptual multistability and its underlying neural mechanisms. We focus on visual plaids that are tristable and we present both experimental and computational results. We develop a firing-rate model based on mutual inhibition and adaptation that involves stochastic dynamics of multiple-attractor systems. The model can account for the dynamic properties (transition probabilities, distributions of percept durations, etc.) observed in the experiments. Noise and adaptation have both been shown to play roles in the dynamics of bistable perception. Here, tristable perception allows us to specify the roles of noise and adaptation in our model. Noise is critical in considering the time of a switch. On the other hand, adaptation mechanisms are critical in considering perceptual choice (in tristable perception, each time a percept ends, there is a possible choice between two new percepts).
1 January 2012 in Discrete and Continuous Dynamical Systems
Some neurons in the nervous system do not show repetitive firing for steady currents. For time-varying inputs, they fire once if the input rise is fast enough. This property of phasic firing is known as Type III excitability. Type III excitability has been observed in neurons in the auditory brainstem (MSO), which show strong phase-locking and accurate coincidence detection. In this paper, we consider a Hodgkin-Huxley type model (RM03) that is widely-used for phasic MSO neurons and we compare it with a modification of it, showing tonic behavior. We provide insight into the temporal processing of these neuron models by means of developing and analyzing two reduced models that reproduce qualitatively the properties of the exemplar ones. The geometric and mathematical analysis of the reduced models allows us to detect and quantify relevant features for the temporal computation such as nearness to threshold and a temporal integration window. Our results underscore the importance of Type III excitability for precise coincidence detection.
1 January 2013 in The Journal of Mathematical Neuroscience
The phase response curve (PRC) is a powerful tool to study the effect of a perturbation on the phase of an oscillator, assuming that all the dynamics can be explained by the phase variable. However, factors like the rate of convergence to the oscillator, strong forcing or high stimulation frequency may invalidate the above assumption and raise the question of how is the phase variation away from an attractor. The concept of isochrons turns out to be crucial to answer this question; from it, we have built up Phase Response Functions (PRF) and, in the present paper, we complete the extension of advancement functions to the transient states by defining the Amplitude Response Function (ARF) to control changes in the transversal variables. Based on the knowledge of both the PRF and the ARF, we study the case of a pulse-train stimulus, and compare the predictions given by the PRC-approach (a 1D map) to those given by the PRF-ARF-approach (a 2D map); we observe differences up to two orders of magnitude in favor of the 2D predictions, especially when the stimulation frequency is high or the strength of the stimulus is large. We also explore the role of hyperbolicity of the limit cycle as well as geometric aspects of the isochrons. Summing up, we aim at enlightening the contribution of transient effects in predicting the phase response and showing the limits of the phase reduction approach to prevent from falling into wrong predictions in synchronization problems. PRC phase response curve, phase resetting curve.PRF phase response function.ARF amplitude response function.
1 January 2013 in SIAM Journal on Applied Dynamical Systems
We present efficient algorithms to compute limit cycles and their isochrons (i.e., the sets of points with the same asymptotic phase) for planar vector fields. We formulate a functional equation for the parameterization of the invariant cycle and its isochrons, and we show that it can be solved by means of a Newton method. Using the right transformations, we can solve the equation of the Newton step efficiently. The algorithms are efficient in the sense that if we discretize the functions using $N$ points, a Newton step requires $O(N)$ storage and $O(N\log N)$ operations in Fourier discretization or $O(N)$ operations in other discretizations. We prove convergence of the algorithms and present a validation theorem in an a posteriori format. That is, we show that if there is an approximate solution of the invariance equation that satisfies some some mild nondegeneracy conditions, then there is a true solution nearby. Thus, our main theorem can be used to validate numerically computed solutions. The theorem also shows that the isochrons are analytic and depend analytically on the base point. Moreover, it establishes smooth dependence of the solutions on parameters and provides efficient algorithms to compute perturbative expansions with respect to external parameters. We include a discussion on the numerical implementation of the algorithms as well as numerical results for representative examples.
1 January 2012 in Discrete and Continuous Dynamical Systems
We present efficient (low storage requirement and low operation count) algorithms for the computation of several invariant objects for Hamiltonian dynamics, namely KAM tori (i.e diffeomorphic copies of tori 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). We also present algorithms to compute the invariant splitting and the invariant manifolds of whiskered tori. We present the algorithms for both discrete-time dynamical systems and differential equations. The algorithms do not require that the system is presented in action-angle variables nor that it is close to integrable and are backed up by rigorous a-posteriori bounds. We will report on the implementation results elsewhere.