Rulkov map

The Rulkov map is a two-dimensional iterated map used to model a biological neuron. It was proposed by Nikolai F. Rulkov in 2001. The use of this map to study neural networks has computational advantages because the map is easier to iterate than a continuous dynamical system. This saves memory and simplifies the computation of large neural networks. The Rulkov map is a two-dimensional iterated map used to model a biological neuron. It was proposed by Nikolai F. Rulkov in 2001. The use of this map to study neural networks has computational advantages because the map is easier to iterate than a continuous dynamical system. This saves memory and simplifies the computation of large neural networks. The Rulkov map, with n {displaystyle n} as discrete time, can be represented by the following dynamical equations: where x {displaystyle x} represents the membrane potential of the neuron. The variable y {displaystyle y} in the model is a slow variable due to a very small value of μ {displaystyle mu } ( 0 < μ << 1 ) {displaystyle (0<mu <<1)} . Unlike variable x {displaystyle x} , variable y {displaystyle y} does not have explicit biological meaning, though some analogy to gating variables can be drawn. The parameter σ {displaystyle sigma } can be thought of as an external dc current given to the neuron and α {displaystyle alpha } is a nonlinearity parameter of the map. Different combinations of parameters σ {displaystyle sigma } and α {displaystyle alpha } give rise to different dynamical states of the neuron like resting, tonic spiking and chaotic bursts. The chaotic bursting is enabled above α > 4 {displaystyle alpha >4} The dynamics of the Rulkov map can be analyzed by analyzing the dynamics of its one dimensional fast submap. Since the variable y {displaystyle y} evolves very slowly, for moderate amount of time it can be treated as a parameter with constant value in the x {displaystyle x} variable's evolution equation (which we now call as one dimensional fast submap because as compared to y {displaystyle y} , x {displaystyle x} is a fast variable). Depending on the value of y {displaystyle y} , this submap can have either one or three fixed points. One of these fixed points is stable, another is unstable and third may change the stability. As y {displaystyle y} increases, two of these fixed points (stable one and unstable one) merge and disappear by saddle-node bifurcation.