Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this...

67
Inducing Order in a Network of Chaotic Elements Sudeshna Sinha The Institute of Mathematical Sciences, Chennai homepage: http://www.imsc.res.in/sudeshna . – p.1/67

Transcript of Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this...

Page 1: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Inducing Order in a Network of ChaoticElements

Sudeshna Sinha

The Institute of Mathematical Sciences, Chennai

homepage: http://www.imsc.res.in/∼sudeshna

. – p.1/67

Page 2: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Lattices of coupled maps were introduced as simplemodels capturing the essential features of nonlineardynamics of extended systems

Such models yield suggestive conceptual frameworksfor spatiotemporal phenomena, in fields ranging frombiology to engineering

The ubiquity of distributed complex systems madelattices of nonlinear maps a focus of sustained researchinterest

. – p.2/67

Page 3: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Then along came the network boom!

Various studies showed that some degree of randomness inspatial coupling is closer to physical reality than strictlyregular scenarios

Many systems of biological, technological and physicalsignificance are better described by randomising somefraction of the regular links

. – p.3/67

Page 4: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

What is the spatiotemporal dynamics of a collection ofelemental dynamical units with varying degrees ofrandomness in its spatial connections?

. – p.4/67

Page 5: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Consider a one-dimensional ring of coupled nonlinear maps

The sites (nodes) are denoted by integers i = 1, . . . , Nwhere N is the size of the lattice (network)

On each site is defined a continuous state variable denotedby xn(i)

Corresponds to the physical variable of interest

. – p.5/67

Page 6: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

The evolution of this lattice in discrete time nunder standard nearest neighbour interactions :

xn+1(i) = (1 − ǫ)f(xn(i)) +ǫ

2xn(i + 1) + xn(i − 1)

Strength of coupling : ǫ

The local on-site map could, for instance, be the fullychaotic logistic map:

f(x) = 4x(1 − x)

. – p.6/67

Page 7: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Now consider the system with its coupling connectionsrewired randomly in varying degrees

At every update we will connect a fraction p of randomlychosen sites in the lattice to two random sites

That is, we will replace a fraction p of nearest neighbourlinks by random connections

p = 0 : corresponds to the usual nearest neighbourinteraction

p = 1 : corresponds to completely random coupling

. – p.7/67

Page 8: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Dynamic Rewiring : random links are switched

Static Rewiring (Quenched) : fixed random links

. – p.8/67

Page 9: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Coupled logistic maps with regular nearest neighbourconnections

. – p.9/67

Page 10: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Coupled strongly chaotic logistic maps with completelyrandom connections

(Sinha, 2002). – p.10/67

Page 11: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Dynamic Random Links create a large window in couplingparameter space where a spatiotemporal fixed point stategains stability

Onset of spatiotemporal fixed point : ǫ∗

For completely random coupling p = 1 : ǫ∗ ∼ 0.6

For all p > 0 : there is a stable region of synchronized fixedpoints

i.e. for all finite p, ǫ∗ < 1

. – p.11/67

Page 12: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

In the stable region of synchronized fixed points

namely, in the parameter interval ǫ∗ ≤ ǫ ≤ 1 :

All lattice sites i are synchronized at xn(i) = x∗ = 3/4

Where x∗ = f(x∗) is the fixed point solution of the individualchaotic maps

x∗ : strongly unstable in the local chaotic map

. – p.12/67

Page 13: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Analyse this system to account for the much enhancedstability of the homogeneous phase under randomconnections

Only possible solution for a spatiotemporally synchronizedstate :

All xn(i) = x∗ only when x∗ = f(x∗)

For the case of the logistic map at r = 4:

Fixed point solution of the local map x∗ = 4x∗(1 − x∗) = 3/4

. – p.13/67

Page 14: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

To calculate the stability of the lattice with all sites at x∗ wewill construct an average probabilistic evolution rule for thesites :

mean field version of the dynamics

Some effects due to fluctuations are lost, but as a firstapproximation we have found this approach qualitativelyright, and quantitatively close to to the numerical results aswell

. – p.14/67

Page 15: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

All sites have probability p of being coupled to random sites,and probability (1 − p) of being wired to nearest neighbours

Then the averaged evolution equation of a site j is

xn+1(j) = (1 − ǫ)f(xn(j)) + (1 − p) ǫ2 xn(j + 1) + xn(j − 1)

+p ǫ2 xn(ξ) + xn(η)

where ξ and η are random integers between 1 and N

. – p.15/67

Page 16: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Linear Stability Analysis of the coherent state:

Replacing xn(j) = x∗ + hn(j), and expanding to first ordergives

hn+1(j) = (1− ǫ)f ′(x∗)hn(j) + (1− p) ǫ2 hn(j + 1) + hn(j − 1)

+p ǫ2 hn(ξ) + hn(η)

≈ (1 − ǫ)f ′(x∗)hn(j) + (1 − p) ǫ2 hn(j + 1) + hn(j − 1)

i.e., to a first approximation one can consider the sum overthe fluctuations of the random neighbours to be zero

This approximation is clearly more valid for small p

. – p.16/67

Page 17: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

For stability considerations one can diagonalize the aboveexpression using a Fourier transform

hn(j) =∑

q

φn(q) exp(ijq)

where q is the wavenumber and j is the site index

This finally leads us to the following growth equation:

φn+1

φn

= f ′(x∗)(1 − ǫ) + ǫ(1 − p) cos q

with q going from 0 to π

. – p.17/67

Page 18: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Clearly the stabilization condition will depend on the natureof the local map f(x) through the term f ′(x)

Considering the fully chaotic logistic map with f ′(x∗) = −2,one finds that the growth coefficient that appears in thisformula is smaller than one in magnitude if and only if

1

1 + p< ǫ < 1

i.e.

ǫ∗ =1

1 + p

. – p.18/67

Page 19: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

The range of stability R = 1 − ǫ∗ is

R = 1 −1

1 + p=

p

1 + p

For small p (p << 1) standard expansion gives

R ∼ p

Regular nearest neighbour couplings ( p = 0 ) gives anull range

Fully random connections ( p = 1 ) yields the largeststable range : R ∼ 1/2

. – p.19/67

Page 20: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Synchronized Fixed Point Range R vs. random rewiringprobability p

Solid line : analytical result; Dotted line: R = p

Points : Simulations (with different lattice sizes N = 10, 50, 100, 500)

(Sinha, 2002)

. – p.20/67

Page 21: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

So stability analysis clearly dictates that enhancedstability of the spatiotemporally homogeneous phasemust occur under random connections, just asnumerical evidence shows

So any degree of randomness in spatial couplingconnections opens up a synchronized fixed pointwindow

Dependence of the stability on p : monotonic

No enhancement at dilute rewiring (’small world limit’)

. – p.21/67

Page 22: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Results from Other Models

Coupled tent maps, with the local map given as:

f(x) = 1 − 2|x − 1/2|

Unstable fixed point : x∗ = 2/3

Local slope : f ′(x∗) = −2

. – p.22/67

Page 23: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Coupled circle map networks, where the local map is

f = x + Ω −K

2πsin(2πx)

A representative example: Ω = 0,K = 3

Unstable fixed point : x∗ = 12π

sin−1(Ω/K)

Local slope : f ′(x∗) = −2

In both systems random rewiring yields stablespatiotemporal synchronisation

. – p.23/67

Page 24: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Coupled sine circle maps with strictly regular nearestneighbour connections

. – p.24/67

Page 25: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Coupled sine circle maps with completely randomconnections

. – p.25/67

Page 26: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Since f ′(x∗) = −2 for both the tent map and the circlemap, we expect from our analysis that their ǫ∗ and R willbe the same as for the logistic map

This agrees with simulations :

Numerically obtained ǫ∗ values for ensembles ofcoupled tent, circle and logistic maps fallindistinguishably around each other, even for high pwhere the analysis is expected to be less accurate

. – p.26/67

Page 27: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Coupled tent maps (open squares)Coupled circle maps (open triangles)Coupled logistic maps (open circles)

. – p.27/67

Page 28: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Static Rewiring

For dynamical rewiring : the synchronization range R isindependent of the size and initial network connections

On the other hand, for static rewiring there is a spread inthe values of R obtained from different realisations of therandom connections

. – p.28/67

Page 29: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

The distribution of R is dependent on the size of network,with average R scaling with N as :

< R >∼ N−ν

with ν ∼ 0.24

. – p.29/67

Page 30: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Average range < R > of spatiotemporal synchronizationobtained in the case of static random connections withrespect to network size N ( p = 1 )

. – p.30/67

Page 31: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

This behaviour can be understood by a examining thelinear stability of the homogeneous solution: xn(j) = x∗

for all sites j at all times n

Considering the dynamics of small perturbations overthe network, one obtains the transfer matrix connectingthe perturbation vectors at successive times to be asum of :

N × N diagonal matrix : with entries (1 − ǫ)f ′(x∗)

ǫ/2 × C : where C is the connectivity matrix

For example: for p = 1, C is a N × N sparse non-symmetricmatrix with two random entries of 1 on each row

. – p.31/67

Page 32: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

The minimum of the real part of the eigenvalues of C,λmin, crucially governs the stability

Typically ǫ∗ = 2/λmin + 4 when f ′(x∗) = −2

Now the values of λmin obtained from different staticrealisations of the connectivity matrix C are distributeddifferently for different sizes N

For small N this distribution is broad and has lessnegative averages (∼ −1)

On the other hand for large N the distribution getsnarrower and tends towards the limiting value of −2

This implies that the range of stability tends to zero forlarge enough networks under static rewiring

. – p.32/67

Page 33: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Same Fraction of Random Links at all times

Dynamic Rewiring (Switched Random Links) :Spatiotemporal Fixed Point

Static Rewiring (Frozen Random Links) : SpatiotemporalChaos

. – p.33/67

Page 34: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Static to Dynamic Transition

Poster of Arghya Mondal

How fast does a network have to rewire in order to inducespatiotemporal order?

. – p.34/67

Page 35: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Coupled Model Neurons

with Maruthi Pradeep, Abhijit Sonawane, Prashant Gade

. – p.35/67

Page 36: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Nodal Dynamics: Maps that reproduce some of the basicfeatures of the firing dynamics of neurons

For instance:

xt+1 = x2t exp(yt − xt) + k

yt+1 = ayt − bxt + c

x : related to an instantaneous membrane potential ofthe neuron

y : equivalent to a recovery current

. – p.36/67

Page 37: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

parameter a : determines the time constant ofreactivation

parameter b : the activation dependence of the recoveryprocess

parameter c : the maximum amplitude of the recoverycurrent

parameter k : can be viewed either as a constant biasor as a time-dependent external stimulation

The parameters here are chosen so as to make thedynamics completely chaotic

. – p.37/67

Page 38: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Phase diagram of coupled model neurons in the space ofcoupling strength ǫ and rewiring probability p

0.0 0.2 0.4 0.6 0.80.0

0.2

0.4

0.6

0.8

1.0

ε

S.F.PS.T.C

S.C

p

S.C.: synchronized chaos S. T. C.: spatiotemporal chaosS. F. P. : synchronized fixed point

. – p.38/67

Page 39: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Instantaneous spatial pattern in the network : p = 0 andp = 1

0

0.5

1

1.5

2

2.5

3

3.5

4

4.5

0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

Sp

atia

l P

att

ern

xn(i)

i=1

,10

0

Coupling Strength

0

0.5

1

1.5

2

2.5

3

3.5

4

4.5

5

0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

Sp

atia

l P

att

ern

xn(i)

i=1

,10

0

Coupling Strength

. – p.39/67

Page 40: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Time series of of a representative model neuron

. – p.40/67

Page 41: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Range of spatial synchronisation increases with p

0.0 0.2 0.4 0.6 0.8 1.010-3

10-2

10-1

Ran

ge o

f Cou

plin

g

p

Exact analytic calculation : matches numerics

. – p.41/67

Page 42: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Network of Non-identical Neurons : synchronization isrobust

Dynamic (Switched) random links gives rise to strongersynchronization than quenched (static) random links

Quenched random coupling reduces synchronizationerror but does not yield complete synchronization asobtained by dynamic random coupling

. – p.42/67

Page 43: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Neuronal Model II:

xn+1 = f(xn, yn + β)

yn+1 = yn − µ(xn + 1) + µσ

where xn is the fast and yn is the slow variable, and

f(x, y) = α/(1 − x) + y when x ≤ 0f(x, y) = α + y when 0 < x < α + yf(x, y) = 1 when x ≥ α + y

Many different activity patterns occur at varying time scales:including both spiking and bursting

. – p.43/67

Page 44: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Phase Synchronization: Bursting pattern in-phase

-3

-2.5

-2

-1.5

-1

-0.5

0

0.5

1

1.5

2

0 1000 2000 3000 4000 5000 6000 7000 8000 9000 10000

x

Time n

. – p.44/67

Page 45: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

For Spiking, Bursting and Spiking-Bursting Patterns :synchronization is enhanced by increasingly random links

. – p.45/67

Page 46: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Ring of Coupled Cells

The single cell consists of a minimal biochemical pathwayof three-step reaction sequence

It is a general model of a large variety of functionaldynamics observed in cellular systems

Somdatta Sinha, Rajesh

. – p.46/67

Page 47: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Here, a substrate S1 is converted to another substrate S2and it is then converted to S3 through a reaction mediatedby an enzyme

It is assumed that two different feedback loops governs theregulatory process of the pathway

The first one is a negative feedback, which is provided bythe end-product inhibition of S2 by S3 and the other is dueto the autocatalytic production of S2 by S3 by the enzyme

. – p.47/67

Page 48: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

dx

dt= F (z) − kx

dy

dt= x − G(y, z)

dz

dt= G(y, z) − qz

F (z) = 11+z4 ; G(y, z) = Ty(1+y)(1+z)2

L+(1+y)2(1+z)2

Coupling : Diffusion of end-product z

. – p.48/67

Page 49: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

p = 0 p = 0.05

. – p.49/67

Page 50: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Efficiency of Dynamic Rewiring vis-a-vis Static Disorder

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

Syn

chro

niza

tion

Ord

er P

aram

eter

R

Rewiring Fraction p

p → 0 transition to synchronization for Dynamic Rewiring

. – p.50/67

Page 51: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Epidemic Modelling

Basic question: How does the dynamics of an infectiousdisease depend on the structure and connectivity of apopulation ?

Role of the underlying network structure on the temporaldynamics of the epidemic

How does the dynamics of the disease at the individuallevel (at the nodes) affect the spread of infection ?

. – p.51/67

Page 52: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Broad qualitative features of the spread of infectiousdisease can be captured by a simple model : SIRS(Susceptible-Infected-Refractory-Susceptible)

Crucial ingredient : connection network :

Yields transition from low quasi-fixed state (analogousto endemic infection) to self-sustained oscillations(analogous to periodic outbreak of disease) as randomlinks increases

The formation of persistent oscillations in increasinglyrandom networks corresponds to a spontaneoussynchronization of a significant fraction of the elementsin the system

. – p.52/67

Page 53: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Nonlocal connections important in the spread of disease:outbreaks can affect locations far apart geographically

5200 5300 5400 5500 56000.0

0.2

0.4

t

p = 0.9

0.0

0.2

0.4

nin

f (t) p = 0.2

0.0

0.2

0.4 p = 0.01

Kuperman and Abramson. – p.53/67

Page 54: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

But timescales of the intrinsic disease cycle (nodaldynamics) also play a role

Longer disease cycle leads to large periodic oscillationsarising from synchronized disease outbreaks

. – p.54/67

Page 55: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

(c)

0 1 2 3 4 50

0.2

0.4

0.6

0.8

1

(d)

0 1 2 3 4 50

0.2

0.4

0.6

0.8

1

(a)

0 1 2 3 4 50

0.2

0.4

0.6

0.8

1

(b)

0 1 2 3 4 50

0.2

0.4

0.6

0.8

1

Fraction of infected sites vs time for different lengths of thedisease cycle for fixed randomness

Gade, Sinha, 2005

. – p.55/67

Page 56: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

An intuitive reason for this : For longer cycles theinformation that a given site is infected can propagate more,since the site stays infected for a longer time

Effective information transfer leads to collective phenomenalike periodic excitations appearing spontaneously in thesystem

. – p.56/67

Page 57: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

For instance, Ebola is far more deadly virus than HIV andkills the host much faster as it has a much shorterincubation period

However, due to the very fact that it kills so swiftly, Ebolaoutbreaks are contained very soon

The people infected by Ebola die very quickly, and so thevirus has less time to jump to a new host and spread thedisease

If no new victims come in contact with the body fluids ofinfected people in their short lifetime, the epidemic stops

On the other hand, HIV remains a problem worldwide sincevictim lives longer and has longer time to infect others

. – p.57/67

Page 58: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Transition point decreases as the disease progresses moreslowly

. – p.58/67

Page 59: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Thus there is a clear interplay between the probability ofnonlocal connections p and the timescales in the system

This suggests that in an extended parameter space onecan find synchronization transitions at infinitesimal p in thevery slow driving parameter limit

. – p.59/67

Page 60: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Asynchronous Updating enhances SpatiotemporalRegularity

with Mitaxi Mehta (2000)

with Manish Shrimali & Kazu Aihara (2007)

. – p.60/67

Page 61: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

2-dimensional lattices of coupled chaotic maps

352 Chaos, Vol. 10, No. 2, 2000

. – p.61/67

Page 62: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

. – p.62/67

Page 63: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Stability Analysis with Probabilistic Dynamical EvolutionEquation yields good match with numerics

. – p.63/67

Page 64: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Threshold Coupled Systems

Local neuronal dynamics

. – p.64/67

Page 65: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

0 0.2 0.4 0.6 0.8 1

time

spac

e

1

(c)

10 20 30 40 50

10

20

30

40

50

0 0.2 0.4 0.6 0.8 1

time

spac

e

(b)

1 10 20 30 40 50

10

20

30

40

50

0 0.2 0.4 0.6 0.8 1

time

spac

e

1

(a)

10 20 30 40 50

10

20

30

40

50

0 0.2 0.4 0.6 0.8 1

time

spac

e

1

(a)

10 20 30 40 50

10

20

30

40

50

. – p.65/67

Page 66: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

Outlook

The regularising effect of random non-local couplingsuggests a mechanism for regulation in natural physicaland biological systems

It also can help in designing efficient control methodsfor spatially extended interactive systems

Significance of the Interplay between nodal dynamicsand connectivity

Significance of dynamic rewiring vis-a-vis static rewiring

. – p.66/67

Page 67: Inducing Order in a Network of Chaotic Elementssudeshna/bionet08_sinha.pdfThe evolution of this lattice in discrete time n under standard nearest neighbour interactions : xn+1(i) =

S. Sinha, Phys. Rev. E, v. 66 (2002) 016209

S. Sinha, Phys. Rev. E, v. 69 (2004) 066209

P.M. Gade & S. Sinha, Phys. Rev. E, v. 72 (2005)

P. M. Gade & S. Sinha, Int. J. of Bif. and Chaos (2006)

S. Rajesh, S. Sinha & S. Sinha, Phys. Rev. E, v. 75 (2007)

Maruthi, Sonawane, Gade & S. Sinha, Phys. Rev. E, v. 75 (2007)

M. Mehta and S. Sinha, Chaos v. 10 (2000)

M. Shrimali, S. Sinha & K. Aihara, Phys. Rev. E v. 76 (2007)

. – p.67/67