dyskretne i niedyskretne modele sieci neuronów

of 39/39
Dyskretne i niedyskretne modele sieci neuronów Winfried Just Department of Mathematics, Ohio University Sungwoo Ahn, Xueying Wang David Terman Department of Mathematics, Ohio State University Mathematical Biosciences Institute

Post on 02-Jan-2016

13 views

Category:

Documents

0 download

Embed Size (px)

DESCRIPTION

Dyskretne i niedyskretne modele sieci neuronów. Winfried Just Department of Mathematics, Ohio University Sungwoo Ahn, Xueying Wang David Terman Department of Mathematics, Ohio State University Mathematical Biosciences Institute. A neuronal system consists of 3 components : - PowerPoint PPT Presentation

TRANSCRIPT

  • Dyskretne i niedyskretne modele sieci neuronw Winfried JustDepartment of Mathematics, Ohio UniversitySungwoo Ahn, Xueying WangDavid TermanDepartment of Mathematics, Ohio State University Mathematical Biosciences Institute

  • A neuronal system consists of 3 components:

    Intrinsic properties of cells

    Synaptic connections between cells

    Network architectureEach of these involve many parameters and multiple time scales. Basic questions:

    Can we classify network behavior?

    Can we design a network that does something of interest?

  • Outline of the talk Network connectivity and discrete dynamics Definition of discrete dynamics Reduction of ODE dynamics to discrete dynamics A small network suggests discrete model ODE models of single-cell dynamics Relation to other models of discrete dynamics

  • Single Cellv = f(v,w)w = g(v,w)A cell may be: excitable or oscillatoryVariable v measures voltage across membrane. It changes on fast timescale.

    Variable w is called gating variable and roughly measures the proportion of open ion channels.It changes on slow timescale.____ v nullcline- - - - w - nullcline

  • v1 = f(v1,w1) gsyns2(v1 vsyn)w1 = eg(v1,w1)s1 = a(1-s1)H(v1-q)-bs1v2 = f(v2,w2) gsyns1(v2-vsyn)w2 = eg(v2,w2)s2 = a(1-s2)H(v2-q)-bs2Two Mutually Coupled CellsSometimes consider indirect synapses:xi = x(1-xi)H(vi-) - xxisi = (1-si)H(xi- x) - siIntroduces a delayin response of synapse Fast or slow. Depends on and Excitatory or Inhibitory. Depends on vsynSynapses may be:s fraction of open synaptic channelsH Heaviside functiongsyn constant maximal conductance

  • Empirical observationsWhen the dynamics of this system is simulated on the computer,one observes rather sharply defined episodes of roughly equal lengthsduring which groups of cells fire (reside on the right branch of the v-nullcline)together, while other cells rest (reside on the left branch of the v-nullcline).

    Membership in these groups may change from episode to episode; a phenomenon that is called dynamic clustering.

    Experimental studies of actual neuronal networks, such as the olfactory bulbin insects or the thalamic cells involved in sleep rhythms appear to show similar patterns.

    This suggests that one could attempt to reduce the ODE dynamics to asimpler discrete model and study the properties of the discrete modelinstead.

  • Reduction to discrete dynamics(1,6)(4,5)(2,3,7)(1,5,6)(2,4,7)(3,6)(1,4,5)Assume: A cell doesnot fire in consecutiveepisodes

  • Some other solutionsNetworkArchitecture

  • What is the state transition graph of the dynamics?How many attractors and transients are there?Network architecture

  • 3456127346346734516723546712534256712567125712351461467144612357235672345672251346134134671234513456712672673524671246735612471723456

  • Remarks1) We have assumed that refractory period = 1If a cell fires then it must wait one episode beforeit can fire again.2) We have assumed that threshold = 1If a cell is ready to fire, then it will fire if it received input from at least one other active cell.For now, we assume that: refractory period of every cell = p threshold for every cell = 1

  • Discrete DynamicsStart with a directed graph D = [ VD, AD ] and integer p.

  • Discrete DynamicsStart with a directed graph D = [ VD, AD ] and integer p.A state s(k) at the discrete time k is a vector: s(k) = [s1(k), ., sn(k)] where si(k) {0, 1, ,p} for each i. (n = # cells)

    The state si(k) = 0 means neuron i fires at time k.Dynamics on the discrete network: If si(k) < p, then si(k+1) = si(k)+1 If si(k) = p, and there exists a j with sj(k)=0 and AD, then si(k+1) = 0. If si(k) = p, and there is no j with sj(k)=0 and AD, then si(k+1) = p.

  • Two IssuesWhen can we reduce the differential equations model to the discrete model?What can we prove about the discrete model? In particular, how does the network connectivity influence the discrete dynamics?

  • Reducing the neuronal model to discrete dynamicsGiven integers n (size of network) and p (refractory period), can we choose intrinsic and synaptic parameters so that for any network architecture, every orbit of the discrete model can be realized by a stable solution of the neuronal model?Answer:- for purely inhibitory networks.NoYes - for excitatory-inhibitory networks.

  • Post-inhibitory reboundWe will consider networks of neurons in which the w-nullcline intersects the left branch of the v-nullcline(s).

    If such a neuron receives excitatory input, the v-nullcline moves up, if it receives inhibitory input, the v-nullcline moves down.

    If two such neurons are coupled by inhibitory synapses, the resulting dynamics is known under the name post-inhibitory rebound.

  • Purely Inhibitory Networkcell 1cell 2cell 3cell 4C(0)C(0)C(1)C(1)g = 0C(2)Note that the distance between cellswithin each cluster increases.

  • Excitatory-Inhibitory Networks

  • Formally reduce E-I network purely inhibitory networkE-cell firesI-cells fireE-cells firedue to reboundWe can then define a graph on the set of E-cellsand define discrete dynamics as before.

  • More precisely:The vertex set of the digraph consists of the numbers of all E-neurons. An arc is included in the digraph if and only if there is some I-neuron x that may receive excitatory input from i and may send inhibitory input to j.

  • Rigorously reducing E-I networks to discrete dynamicsAssume: All-to-all coupling among I-cells

    Inhibitory synapses are indirect (slow)

    Suitable functions f and g

    The ODE dynamics is assumed to be the dynamics on the slow timescale; all trajectories move along the v-nullclines; jumps are instantaneous

  • Discrete vs. ODE modelsConsider any such network with any fixed architecture and fix p,the refractory period. We can then define both the continuousneuronal and discrete models. Let P(0) be any state of the discrete model. We then wish to show that there exists a solution of the neuronal system in which different subsets of cells take turns jumping up to the active phase. The active cells during each subsequent episode are precisely those determined by the discrete orbit of P(0), and this exact correspondence to the discrete dynamics remains valid throughout the trajectory of the initial state. We will saythat such a solution realizes the orbit predicted by the discretemodel. This solution will be stable in the sense that there is aneighborhood of the initial state such that every trajectory thatstarts in this neighborhood realizes the same discrete orbit.

  • Main Theorem (Terman, Ahn, Wang, Just; Physica D, 237(3) (2008))Suppose a discrete model defined by a digraph is given. Then therere are intervals for the choice of the intrinsic parameters of the cells and the synaptic parameters in the ODE model so that:

    1. Every orbit of the discrete model is realized by a stablesolution of the differential equations model.

    2. Every solution of the differential equations model eventuallyrealizes a periodic orbit of the discrete model. That is, ifX(t) is any solution of the differential equations model, thenthere exists T > 0 such that the solution {X(t) : t > T } realizes a periodic orbit or a steady state of the discrete model.

  • StrategySuppose we are given an E-I network.Let s(0) be any initial state of the discrete system.We wish to choose initial positions of the E- and I- cells so that the E-I network produces firing patterns as predicted by the discrete system.E-cells

  • We construct disjoint intervals Jk, k = 0,,p, so that:Let s(0) = (s1, .., sn). Consider E-cells, (vi,wi).Assume: If si(0) = k, then wi(0) Jk.Then: T* > 0 such that if si(1) = k, then wi(T*) Jk. The only E-cells that fire for t [0,T*] are those with si(0) = 0. p = 2

  • Generalized Discrete DynamicsStart with a directed graph D = [ VD, AD ] and vectors ofintegers p = [p1, , pn] and th = [th1, , thn].A state s(k) at the discrete time k is a vector: s(k) = [s1(k), ., sn(k)] where si(k) {0, 1, ,pi} for each i. (n = # cells)The state si(k) = 0 means neuron i fires at time k.Dynamics on the discrete network: If si(k) < p, then si(k+1) = si(k)+1 If si(k) = pi, and there exists at least thi nodes j with sj(k)=0 and AD, then si(k+1) = 0. If si(k) = pi, and there are fewer than thi nodes j with sj(k)=0 and AD, then si(k+1) = pi.

  • Rigorous analysis of discrete modelStart with a directed graph D = [ VD, AD ]pi = refractory period of neuron i thi = threshold of neuron i n = # of vertices.How does the expected dynamics of the discrete model depend on the density of connections?

    We will study this question by considering random initial states in random digraphs with a specified connectionprobability.

  • Some DefinitionsLet L = {s(1), ., s(k)} be an attractor.Act(L) = { i: si(t) = 0 for some t} (the active set of L)L is fully active if Act(L) = [n] = {1, , n}L is a minimal attractor if Act(L) and, for each i Act(L), si(0), ., si(k) cycle through 0, 1, , pi.Let: MA = {states that belong to a minimal attractor} FAMA = {states that belong to a fully active minimal attractor}

  • Consider random digraphs: (n) = probability AD for given .A phase transition occurs when (n) ~ ln n / n.

    Just, Ahn, Terman; Physica D 237(24) (2008)

  • Autonomous setsDefinition: Let s(0) = [s1(0), ., sn(0)] be a state. We say A VD is autonomous for s(0) if for every i A, si(t) is minimally cycling (that is, si(0), si(1), , si(t) cycles through {0, ., pi}) in the discrete system that is obtained by restricting the nodes of the system to VD.

    Example: Active sets of minimal attractors are autonomous. Note that the dynamics on an autonomous set does not depend on the states of the remainder of the nodes.

  • The following result suggests that there exists another phase transition ~ C/n.

    Theorem: Assume that each pi < p and thi < th. Fix (0,1). Then C(p, th, ) such that if (n) > C/n, then with probability tending to one as n , a randomly chosen state will have an autonomous set of size at least n. In particular, most states have a large set of minimally cycling nodes.

    Just, Ahn, Terman; Physica D 237(24) (2008)

  • Numerical explorations

  • Current work in progressWhen the connection probability is ~ 1/n, another phase transition occurs for the case when all refractory periods and all firing thresholds are 1. Below this phase transition, with high probability the basin of attraction of the steady state [1, , 1] becomes the whole state space. We are investigating what happens for connection probabilities slightly above this phase transition. Theoretical results predict longer transients near the phase transition, and this is what we are seeing in simulations. One question we are interested in is whether chaotic dynamics would be generic for connection probabilities in a critical range.

  • Other ongoing researchCan we generalize our first theorem to architectures where the connections between the I-cells are somewhat random rather than all-to-all? How to incorporate learning and processing of inputs into this model?Can we obtain analogous results for networks based on different single-cell ODE dynamics?

  • Hopfield NetworksNetworks are modeled as digraphs with weighted arcs; weights may be positive or negativeEach neuron has a firing threshold thiAt each step, neurons are in state zero or oneThe successor state of a given state is determined by summing the weights of all incoming arcs that originate at neurons that are in state one. If this weight exceeds thi, the neuron goes into state one (fires), otherwise it goes into state zero

  • Hopfield vs. Terman NetworksHopfield networks dont model refractory periodsTerman networks dont allow negatively weighted arcsFor refractory period p = 1, both kinds are examples of Boolean networksDynamics of random Hopfield networks tends to become more chaotic as connectivity increasesRandom Terman networks may allow chaotic dynamics only for narrow range of connectivity

  • Why am I interested in this?My major interests are centered around models of gene regulatory networks.These can be modeled with ODE systems; but Boolean and other discrete models are also being studied in the literature, with the (generally) unrealistic assumption of synchronous updating.Question: Under which conditions can we prove a correspondence between discrete and continuous models of gene regulatory networks as in our first theorem?