Badal Joshi Mathematics, Duke University Stochastic Models in - - PowerPoint PPT Presentation

badal joshi mathematics duke university stochastic models
SMART_READER_LITE
LIVE PREVIEW

Badal Joshi Mathematics, Duke University Stochastic Models in - - PowerPoint PPT Presentation

A COUPLED POISSON PROCESS MODEL FOR WAKE-SLEEP CYCLING Badal Joshi Mathematics, Duke University Stochastic Models in Neuroscience, CIRM January 18, 2010 Outline Biological motivation Experimental background Description of


slide-1
SLIDE 1

A COUPLED POISSON PROCESS MODEL FOR WAKE-SLEEP CYCLING

Badal Joshi Mathematics, Duke University Stochastic Models in Neuroscience, CIRM January 18, 2010

slide-2
SLIDE 2

Outline

 Biological motivation  Experimental background  Description of stochastic model  Analysis and results

slide-3
SLIDE 3

Biological motivation

Behavioral/ Neurological states

Wake Sleep (What is the function/ properties?)

slide-4
SLIDE 4

Some biology

 All mammalian species show sleep behavior

e.g. rats, cats, mice, humans, bats, seals, dolphins, platypus, birds etc. [Siegel (2005)]

 Very few common properties.  Amount of sleep, number of bouts, duration,

timing, behavior during sleep, local/ global sleep (in brain) all vary

 Depend on species, age, gender, habitat,

season, time of day, foraging behavior etc.

slide-5
SLIDE 5

Common features

 Transition from :

sleep -> wake wake -> sleep are stochastic.

 Natural question: What is the

distribution of sleep and wake durations?

slide-6
SLIDE 6

Common features

 Across mammalian species, in adults:

Sleep durations are exponentially distributed. Wake durations are distributed as a power law.

 Sleep and wake durations are uncorrelated

(with each other and with itself). Ref: C.C.Lo et al. (2002) EPL, (2004) PNAS Blumberg et al. (2005) PNAS

slide-7
SLIDE 7

Common features

Time (seconds)

Survivor Function

P (T > t) Time (seconds) Sleep Wake

Survivor Function

P (T > t)

slide-8
SLIDE 8

Different distributions

 Use development perspective to

understand neural mechanism.

 For infants both sleep and wake are

exponentially distributed. [Blumberg et

  • al. (2005)]

 As animal develops wake gradually

changes from exponential to power law.

slide-9
SLIDE 9

Basic switch

DLPT = Dorsolateral Pontine Tegmentum, PnO = Nucleus Pontis Oralis

Two neuronal populations, with mutual

  • inhibition. [Blumberg et al. (2005)]

Wake-Active DLPT Sleep-Active PnO

slide-10
SLIDE 10

Outline of mathematical model

 Poisson process model whose rates are

stochastic processes

 Take appropriate `average’ and get

deterministic dynamical system

 Bifurcation analysis of deterministic system  Use information from bifurcation diagram to

make a prediction about stochastic system. In particular, emergence of power law is related to multiple fixed points.

slide-11
SLIDE 11

Modeling approach

 Model each population as a Poisson process

where the event is a spike occurring at epoch ‘s’.

 The population i is a Poisson process  Make the rate depend on the inputs i.e.

spikes in the input populations

 Model described completely by giving

(stochastic) differential equations for rates.

) ( rate with ) ( t t N

i i

λ

slide-12
SLIDE 12

Stochastic differential equations for the rate processes

diagram wiring the from read be can ) ( functions The k) pop.

  • f

epochs firing are (where ) ( ) ( ) ( ) ( ) (

' ' i ij jk j j i ij i i j k jk i ij i i i

g T N g f t T g f

j j j

λ λ λ δ λ λ λ

∑ ∑ ∑

+ = − + =

slide-13
SLIDE 13

Proposed circuit diagram

Wake-Promoting LC Wake-Active DLPT Sleep-Active PnO Excitatory Connection Inhibitory Connection Population of neurons

LC = Locus Coeruleus DLPT = Dorsolateral Pontine Tegmentum PnO = Nucleus Pontis Oralis

slide-14
SLIDE 14

Explicit model

Restoring autonomous term fi(λi) = ki − λi τi , ki > 0, τi > 0 Inhibition j ⊣ i gij(λi) = −βijλi , 0 ≤ βij ≤ 1 Excitation term j → i gij(λi) = αijλi

  • 1 − λi

si

  • where 0 ≤ αij ≤ 1, si > ki > 0, 0 ≤ λi ≤ si
slide-15
SLIDE 15

Explicit model

λ′

1 = k1 − λ1

τ1 − β12λ1N′

2 + α11λ1

  • 1 − λ1

s1

  • N′

1 + α13λ1

  • 1 − λ1

s1

  • N′

3

λ′

2 = k2 − λ2

τ2 − β21λ2N′

1 + α22λ2

  • 1 − λ2

s2

  • N′

2

λ′

3 = k3 − λ3

τ3 − β32λ3N′

2 + α31λ3

  • 1 − λ3

s3

  • N′

1

slide-16
SLIDE 16

Solutions?

What are the solutions of the system of equations? What are the class of behaviors? More precisely, given parameter values

slide-17
SLIDE 17

Solutions?

What are the solutions of the system of equations? What are the class of behaviors? More precisely, given parameter values

What are the distributions of the firing rates λ1, λ2 and λ3?

slide-18
SLIDE 18

Solutions?

What are the solutions of the system of equations? What are the class of behaviors? More precisely, given parameter values

What are the distributions of the firing rates λ1, λ2 and λ3? What is the distribution of the bout variable I(λ1>λ2)?

slide-19
SLIDE 19

Solution

Solution: Study an appropriate ‘average’ system which is deterministic. Can use classical dynamical system theory to classify all behaviors.

slide-20
SLIDE 20

Solution

Solution: Study an appropriate ‘average’ system which is deterministic. Can use classical dynamical system theory to classify all behaviors. Find only two ‘regimes’

slide-21
SLIDE 21

Solution

Solution: Study an appropriate ‘average’ system which is deterministic. Can use classical dynamical system theory to classify all behaviors. Find only two ‘regimes’

Either single stable fixed point or two stable fixed points.

slide-22
SLIDE 22

Solution

Solution: Study an appropriate ‘average’ system which is deterministic. Can use classical dynamical system theory to classify all behaviors. Find only two ‘regimes’

Either single stable fixed point or two stable fixed points. These correspond to exponential distribution or heavy tailed distribution in bout durations.

slide-23
SLIDE 23

Deterministic system

To identify the appropriate deterministic system to look at, we use the following theorem. Theorem: The expected change in firing rate in time h is given by E[λ(t + h) − λ(t)|Λt] = hf(λ) +

  • j

hgj(λ(t))λj(t) + o(h) Main Assumption in proof: The Poisson property of no two spikes occurring simultaneously holds for the entire collection

  • f the populations of neurons.
slide-24
SLIDE 24

Deterministic system

Theorem: E[λ′(t)|Λt] = f(λ(t)) +

  • j∈input

gj(λ(t))λj(t) In particular the zeros of the right hand side give values of λi for which |λ′

i| is smallest. This suggests studying the deterministic

system ˜ λ′(t) = f(˜ λ(t)) +

  • j∈input

gj(˜ λ(t))˜ λj(t) Compare this with the original stochastic system λ′(t) = f(λ(t)) +

  • j∈input

gj(λ(t))N′

j (t)

slide-25
SLIDE 25

Classification of behaviors of deterministic system

First we rule out closed orbit solutions.

slide-26
SLIDE 26

Classification of behaviors of deterministic system

First we rule out closed orbit solutions. We show all solutions are bounded.

slide-27
SLIDE 27

Classification of behaviors of deterministic system

First we rule out closed orbit solutions. We show all solutions are bounded. We show existence of fixed point solutions.

slide-28
SLIDE 28

Classification of behaviors of deterministic system

First we rule out closed orbit solutions. We show all solutions are bounded. We show existence of fixed point solutions. Conclusion: All trajectories converge to a fixed point solution.

slide-29
SLIDE 29

Monotone dynamical systems

By changing sign of (2), we can make all the arrows positive. So all bounded solutions converge to fixed points.

slide-30
SLIDE 30

Simulation for two component system (Day 2)

1 2 3 4 5 6 7 8 9 100 105 110 115 120 125 130 135 140

Figure: Time course of λ1 (in black) and λ2 (in red)

slide-31
SLIDE 31

Three component system - Effect of Development

5 10 15 20 C1 0.2 0.4 0.6 0.8 1 mutualexc 2 4 6 8 10 C2 0.2 0.4 0.6 0.8 1 mutualexc 2 4 6 8 10 C3 0.2 0.4 0.6 0.8 1 mutualexc

Figure: Steady state firing rates as a function of α := α13 = α31 for β = 0.5, α11 = α22 = 0 and s1 = 20, s2 = 10, s3 = 10

slide-32
SLIDE 32

Simulation of three component system (Day 21)

5 10 15 20 300 350 400 450 500 550 600 650 700

Figure: Time course of λ1 (in black), λ2 (in red) and λ3 (in orange)

slide-33
SLIDE 33

Survivor plots (C.C.D.F .)

5 10 15 20 25 30 10 −4 10 −3 10 −2 10 −1 10 20 40 60 80 100 120 10 −4 10 −3 10 −2 10 −1 10 10 10 1 10 2 10 −4 10 −3 10 −2 10 −1 10 10 10 1 10 2 10 −4 10 −3 10 −2 10 −1 10

Figure: Survivor plots for sleep (left) and wake (right) on a semi-log scale (top) and a log-log scale (bottom) for α13 = α31 = 0.6, α11 = α22 = 0, β = 0.5

slide-34
SLIDE 34

Thanks!

Reference: Badal Joshi, A doubly stochastic Poisson process model for wake-sleep cycling, PhD Dissertation (2009), Ohio State University. Thanks to the organizers and faculty of ‘Stochastic Models in Neuroscience’!